Base | Representation |
---|---|
bin | 11011101111010110011000… |
… | …001111011000011100110111 |
3 | 120222222012011102212110001222 |
4 | 123233112120033120130313 |
5 | 111442331223123241043 |
6 | 1111250310503140555 |
7 | 34461200665300364 |
oct | 3357263017303467 |
9 | 528865142773058 |
10 | 122001100212023 |
11 | 3596741556462a |
12 | 1182476974475b |
13 | 530c8678b7376 |
14 | 221ac55ab546b |
15 | e187de00bd68 |
hex | 6ef5983d8737 |
122001100212023 has 8 divisors (see below), whose sum is σ = 122309790699888. Its totient is φ = 121692756375424.
The previous prime is 122001100211983. The next prime is 122001100212031. The reversal of 122001100212023 is 320212001100221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122001100212023 - 218 = 122001099949879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122001100211992 and 122001100212010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122001100262023) 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, 85958036 + ... + 87365817.
It is an arithmetic number, because the mean of its divisors is an integer number (15288723837486).
Almost surely, 2122001100212023 is an apocalyptic number.
122001100212023 is a deficient number, since it is larger than the sum of its proper divisors (308690487865).
122001100212023 is a wasteful number, since it uses less digits than its factorization.
122001100212023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173325633.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 122001100212023 its reverse (320212001100221), we get a palindrome (442213101312244).
The spelling of 122001100212023 in words is "one hundred twenty-two trillion, one billion, one hundred million, two hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •