Base | Representation |
---|---|
bin | 1100000101010011001… |
… | …01110001101011011010 |
3 | 1110200121100202111112120 |
4 | 12002221211301223122 |
5 | 23300223000101410 |
6 | 514420044522110 |
7 | 41665050506211 |
oct | 6025145615332 |
9 | 1420540674476 |
10 | 415162112730 |
11 | 15008420a082 |
12 | 68564b50336 |
13 | 301c3937691 |
14 | 16145b46078 |
15 | abeca81570 |
hex | 60a9971ada |
415162112730 has 128 divisors (see below), whose sum is σ = 1025533716480. Its totient is φ = 107519892480.
The previous prime is 415162112693. The next prime is 415162112731. The reversal of 415162112730 is 37211261514.
It is a junction number, because it is equal to n+sod(n) for n = 415162112691 and 415162112700.
It is not an unprimeable number, because it can be changed into a prime (415162112731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 64173936 + ... + 64180404.
It is an arithmetic number, because the mean of its divisors is an integer number (8011982160).
Almost surely, 2415162112730 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 415162112730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (512766858240).
415162112730 is an abundant number, since it is smaller than the sum of its proper divisors (610371603750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
415162112730 is a wasteful number, since it uses less digits than its factorization.
415162112730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6936.
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 415162112730 in words is "four hundred fifteen billion, one hundred sixty-two million, one hundred twelve thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •