Base | Representation |
---|---|
bin | 11011010010100100010110… |
… | …000111010110100101000111 |
3 | 120201222002221102002122122212 |
4 | 123102210112013112211013 |
5 | 111212430034410103332 |
6 | 1103133524525414035 |
7 | 34165251402660011 |
oct | 3322442607264507 |
9 | 521862842078585 |
10 | 120023232112967 |
11 | 3527462658a577 |
12 | 1156538170a31b |
13 | 51c81b0607a91 |
14 | 218d2266dd1b1 |
15 | dd212e0148b2 |
hex | 6d29161d6947 |
120023232112967 has 2 divisors, whose sum is σ = 120023232112968. Its totient is φ = 120023232112966.
The previous prime is 120023232112963. The next prime is 120023232113039. The reversal of 120023232112967 is 769211232320021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120023232112967 - 22 = 120023232112963 is a prime.
It is a super-2 number, since 2×1200232321129672 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120023232112963) 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 as a sum of consecutive naturals, namely, 60011616056483 + 60011616056484.
It is an arithmetic number, because the mean of its divisors is an integer number (60011616056484).
Almost surely, 2120023232112967 is an apocalyptic number.
120023232112967 is a deficient number, since it is larger than the sum of its proper divisors (1).
120023232112967 is an equidigital number, since it uses as much as digits as its factorization.
120023232112967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 41.
Adding to 120023232112967 its reverse (769211232320021), we get a palindrome (889234464432988).
The spelling of 120023232112967 in words is "one hundred twenty trillion, twenty-three billion, two hundred thirty-two million, one hundred twelve thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •