Base | Representation |
---|---|
bin | 10010111010000010… |
… | …01000110111001001 |
3 | 222012101222112200110 |
4 | 21131001020313021 |
5 | 131242012422441 |
6 | 4355120424533 |
7 | 506352642426 |
oct | 113501106711 |
9 | 28171875613 |
10 | 10150514121 |
11 | 4339778550 |
12 | 1b73478149 |
13 | c59c39397 |
14 | 6c4142d4d |
15 | 3e61deb16 |
hex | 25d048dc9 |
10150514121 has 8 divisors (see below), whose sum is σ = 14764384224. Its totient is φ = 6151826720.
The previous prime is 10150514107. The next prime is 10150514221. The reversal of 10150514121 is 12141505101.
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 10150514121 - 27 = 10150513993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10150514021) 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, 153795636 + ... + 153795701.
It is an arithmetic number, because the mean of its divisors is an integer number (1845548028).
Almost surely, 210150514121 is an apocalyptic number.
10150514121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10150514121 is a deficient number, since it is larger than the sum of its proper divisors (4613870103).
10150514121 is a wasteful number, since it uses less digits than its factorization.
10150514121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307591351.
The product of its (nonzero) digits is 200, while the sum is 21.
The spelling of 10150514121 in words is "ten billion, one hundred fifty million, five hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •