Base | Representation |
---|---|
bin | 11101000110110000100… |
… | …100011000101101000111 |
3 | 21002012122221122020112020 |
4 | 131012300210120231013 |
5 | 230232222230333111 |
6 | 4130502102254223 |
7 | 264334614342036 |
oct | 35066044305507 |
9 | 7065587566466 |
10 | 2000122121031 |
11 | 701279881161 |
12 | 283778a27373 |
13 | 1167c2951838 |
14 | 6cb40b9c71d |
15 | 37063aa1906 |
hex | 1d1b0918b47 |
2000122121031 has 16 divisors (see below), whose sum is σ = 2717561957760. Its totient is φ = 1308056199840.
The previous prime is 2000122121009. The next prime is 2000122121071. The reversal of 2000122121031 is 1301212210002.
It is not a de Polignac number, because 2000122121031 - 26 = 2000122120967 is a prime.
It is a super-2 number, since 2×20001221210312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2000122121031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000122121071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87600 + ... + 2001978.
It is an arithmetic number, because the mean of its divisors is an integer number (169847622360).
Almost surely, 22000122121031 is an apocalyptic number.
2000122121031 is a deficient number, since it is larger than the sum of its proper divisors (717439836729).
2000122121031 is a wasteful number, since it uses less digits than its factorization.
2000122121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1921006.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2000122121031 its reverse (1301212210002), we get a palindrome (3301334331033).
The spelling of 2000122121031 in words is "two trillion, one hundred twenty-two million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •