Base | Representation |
---|---|
bin | 11011101111010101010111… |
… | …010101001011010011100001 |
3 | 120222222002100112201111212211 |
4 | 123233111113111023103201 |
5 | 111442322010332241001 |
6 | 1111250010442122121 |
7 | 34461132003040246 |
oct | 3357252725132341 |
9 | 528862315644784 |
10 | 122000011212001 |
11 | 35966a0688280a |
12 | 11824504ab0341 |
13 | 530c7230b8460 |
14 | 221ab911db5cd |
15 | e187785ea351 |
hex | 6ef55754b4e1 |
122000011212001 has 16 divisors (see below), whose sum is σ = 134601088981968. Its totient is φ = 109858916044800.
The previous prime is 122000011211963. The next prime is 122000011212019. The reversal of 122000011212001 is 100212110000221.
It can be written as a sum of positive squares in 8 ways, for example, as 24624659480976 + 97375351731025 = 4962324^2 + 9867895^2 .
It is not a de Polignac number, because 122000011212001 - 27 = 122000011211873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122000011213001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4160976 + ... + 16165201.
It is an arithmetic number, because the mean of its divisors is an integer number (8412568061373).
Almost surely, 2122000011212001 is an apocalyptic number.
It is an amenable number.
122000011212001 is a deficient number, since it is larger than the sum of its proper divisors (12601077769967).
122000011212001 is a wasteful number, since it uses less digits than its factorization.
122000011212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20337492.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122000011212001 its reverse (100212110000221), we get a palindrome (222212121212222).
The spelling of 122000011212001 in words is "one hundred twenty-two trillion, eleven million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •