Base | Representation |
---|---|
bin | 101111101000111101… |
… | …100111011111011011 |
3 | 11220000221121001221002 |
4 | 233220331213133123 |
5 | 1314230143410112 |
6 | 35255512335215 |
7 | 3460423143320 |
oct | 575075473733 |
9 | 156027531832 |
10 | 51153106907 |
11 | 1a76a660371 |
12 | 9ab70a450b |
13 | 4a92925cc6 |
14 | 2693934b47 |
15 | 14e5c1b1c2 |
hex | be8f677db |
51153106907 has 8 divisors (see below), whose sum is σ = 58462419456. Its totient is φ = 43844225832.
The previous prime is 51153106871. The next prime is 51153106937. The reversal of 51153106907 is 70960135115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51153106907 - 28 = 51153106651 is a prime.
It is a super-2 number, since 2×511531069072 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51153106937) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207758 + ... + 381404.
It is an arithmetic number, because the mean of its divisors is an integer number (7307802432).
Almost surely, 251153106907 is an apocalyptic number.
51153106907 is a deficient number, since it is larger than the sum of its proper divisors (7309312549).
51153106907 is a wasteful number, since it uses less digits than its factorization.
51153106907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215737.
The product of its (nonzero) digits is 28350, while the sum is 38.
The spelling of 51153106907 in words is "fifty-one billion, one hundred fifty-three million, one hundred six thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •