Base | Representation |
---|---|
bin | 110111111011010110… |
… | …1110011101000110001 |
3 | 102111000012120211001022 |
4 | 1233312231303220301 |
5 | 3431432422220423 |
6 | 131101422545225 |
7 | 11451162243140 |
oct | 1576655635061 |
9 | 374005524038 |
10 | 120103320113 |
11 | 46a32214047 |
12 | 1b33a438215 |
13 | b43072112a |
14 | 5b54d5d757 |
15 | 31ce0b3dc8 |
hex | 1bf6b73a31 |
120103320113 has 16 divisors (see below), whose sum is σ = 142021313280. Its totient is φ = 99376783296.
The previous prime is 120103320041. The next prime is 120103320121. The reversal of 120103320113 is 311023301021.
It is not a de Polignac number, because 120103320113 - 216 = 120103254577 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120103320091 and 120103320100.
It is not an unprimeable number, because it can be changed into a prime (120103320133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1057820 + ... + 1165842.
It is an arithmetic number, because the mean of its divisors is an integer number (8876332080).
Almost surely, 2120103320113 is an apocalyptic number.
It is an amenable number.
120103320113 is a deficient number, since it is larger than the sum of its proper divisors (21917993167).
120103320113 is a wasteful number, since it uses less digits than its factorization.
120103320113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113536.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 120103320113 its reverse (311023301021), we get a palindrome (431126621134).
The spelling of 120103320113 in words is "one hundred twenty billion, one hundred three million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •