Base | Representation |
---|---|
bin | 1010001011001000… |
… | …00010010000111110 |
3 | 112002122210110120100 |
4 | 11011210002100332 |
5 | 42141240313122 |
6 | 2301554301530 |
7 | 252232405500 |
oct | 50544022076 |
9 | 15078713510 |
10 | 5462041662 |
11 | 23531a8820 |
12 | 10852878a6 |
13 | 6907b351c |
14 | 39b5b5d70 |
15 | 21e7c2aac |
hex | 14590243e |
5462041662 has 144 divisors (see below), whose sum is σ = 15101070192. Its totient is φ = 1410877440.
The previous prime is 5462041631. The next prime is 5462041667. The reversal of 5462041662 is 2661402645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5462041667) 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 71 ways as a sum of consecutive naturals, for example, 1871028 + ... + 1873944.
It is an arithmetic number, because the mean of its divisors is an integer number (104868543).
Almost surely, 25462041662 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5462041662, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7550535096).
5462041662 is an abundant number, since it is smaller than the sum of its proper divisors (9639028530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5462041662 is a wasteful number, since it uses less digits than its factorization.
5462041662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3143 (or 3133 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The square root of 5462041662 is about 73905.6267276044. The cubic root of 5462041662 is about 1761.1039972170.
The spelling of 5462041662 in words is "five billion, four hundred sixty-two million, forty-one thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •