Base | Representation |
---|---|
bin | 11011010010100100010110… |
… | …000111010110100101110011 |
3 | 120201222002221102002122201111 |
4 | 123102210112013112211303 |
5 | 111212430034410104021 |
6 | 1103133524525414151 |
7 | 34165251402660103 |
oct | 3322442607264563 |
9 | 521862842078644 |
10 | 120023232113011 |
11 | 3527462658a607 |
12 | 1156538170a357 |
13 | 51c81b0607ac6 |
14 | 218d2266dd203 |
15 | dd212e0148e1 |
hex | 6d29161d6973 |
120023232113011 has 8 divisors (see below), whose sum is σ = 120538758618720. Its totient is φ = 119507709072192.
The previous prime is 120023232112967. The next prime is 120023232113039. The reversal of 120023232113011 is 110311232320021.
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 120023232113011 - 225 = 120023198558579 is a prime.
It is a super-2 number, since 2×1200232321130112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120023232117011) 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, 88171881 + ... + 89522773.
It is an arithmetic number, because the mean of its divisors is an integer number (15067344827340).
Almost surely, 2120023232113011 is an apocalyptic number.
120023232113011 is a deficient number, since it is larger than the sum of its proper divisors (515526505709).
120023232113011 is a wasteful number, since it uses less digits than its factorization.
120023232113011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1732445.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 120023232113011 its reverse (110311232320021), we get a palindrome (230334464433032).
The spelling of 120023232113011 in words is "one hundred twenty trillion, twenty-three billion, two hundred thirty-two million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •