Base | Representation |
---|---|
bin | 11101101100000111110… |
… | …10111011111001101001 |
3 | 10121112002221201110001221 |
4 | 32312003322323321221 |
5 | 113203201322423103 |
6 | 2100345322542041 |
7 | 133462352205106 |
oct | 16660372737151 |
9 | 3545087643057 |
10 | 1020120514153 |
11 | 3636a3487a94 |
12 | 145858367921 |
13 | 7527391a410 |
14 | 3753473daad |
15 | 1b807d8a1bd |
hex | ed83ebbe69 |
1020120514153 has 8 divisors (see below), whose sum is σ = 1098981072000. Its totient is φ = 941315634768.
The previous prime is 1020120514123. The next prime is 1020120514157. The reversal of 1020120514153 is 3514150210201.
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 1020120514153 - 25 = 1020120514121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020120514157) 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, 13881553 + ... + 13954846.
It is an arithmetic number, because the mean of its divisors is an integer number (137372634000).
Almost surely, 21020120514153 is an apocalyptic number.
1020120514153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1020120514153 is a deficient number, since it is larger than the sum of its proper divisors (78860557847).
1020120514153 is a wasteful number, since it uses less digits than its factorization.
1020120514153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27839231.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 1020120514153 its reverse (3514150210201), we get a palindrome (4534270724354).
The spelling of 1020120514153 in words is "one trillion, twenty billion, one hundred twenty million, five hundred fourteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •