Base | Representation |
---|---|
bin | 11011101111100000101001… |
… | …001111111111110011011011 |
3 | 121000000020121122012022012020 |
4 | 123233200221033333303123 |
5 | 111443021311442112443 |
6 | 1111255332343545523 |
7 | 34462041102421452 |
oct | 3357405117776333 |
9 | 530006548168166 |
10 | 122012123004123 |
11 | 3597106164a470 |
12 | 1182692515b2a3 |
13 | 5310903461c61 |
14 | 221b5bd9d9b99 |
15 | e18c36a9e583 |
hex | 6ef8293ffcdb |
122012123004123 has 32 divisors (see below), whose sum is σ = 183042719419392. Its totient is φ = 71656837824000.
The previous prime is 122012123004119. The next prime is 122012123004229. The reversal of 122012123004123 is 321400321210221.
It is not a de Polignac number, because 122012123004123 - 22 = 122012123004119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122012123004093 and 122012123004102.
It is not an unprimeable number, because it can be changed into a prime (122012123014123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 389282686 + ... + 389595987.
It is an arithmetic number, because the mean of its divisors is an integer number (5720084981856).
Almost surely, 2122012123004123 is an apocalyptic number.
122012123004123 is a deficient number, since it is larger than the sum of its proper divisors (61030596415269).
122012123004123 is a wasteful number, since it uses less digits than its factorization.
122012123004123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778878835.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 122012123004123 its reverse (321400321210221), we get a palindrome (443412444214344).
The spelling of 122012123004123 in words is "one hundred twenty-two trillion, twelve billion, one hundred twenty-three million, four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •