Base | Representation |
---|---|
bin | 1010001011001000… |
… | …10001110001001001 |
3 | 112002122220200200011 |
4 | 11011210101301021 |
5 | 42141244331121 |
6 | 2301555511521 |
7 | 252233061562 |
oct | 50544216111 |
9 | 15078820604 |
10 | 5462105161 |
11 | 23532414a7 |
12 | 10852b85a1 |
13 | 6908063b6 |
14 | 39b5d1169 |
15 | 21e7d67e1 |
hex | 145911c49 |
5462105161 has 4 divisors (see below), whose sum is σ = 5749584400. Its totient is φ = 5174625924.
The previous prime is 5462105153. The next prime is 5462105177. The reversal of 5462105161 is 1615012645.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5462105161 - 23 = 5462105153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5462105101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 143739591 + ... + 143739628.
It is an arithmetic number, because the mean of its divisors is an integer number (1437396100).
Almost surely, 25462105161 is an apocalyptic number.
It is an amenable number.
5462105161 is a deficient number, since it is larger than the sum of its proper divisors (287479239).
5462105161 is a wasteful number, since it uses less digits than its factorization.
5462105161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287479238.
The product of its (nonzero) digits is 7200, while the sum is 31.
The square root of 5462105161 is about 73906.0563215221. The cubic root of 5462105161 is about 1761.1108217658.
The spelling of 5462105161 in words is "five billion, four hundred sixty-two million, one hundred five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •