Base | Representation |
---|---|
bin | 11101000110110000100… |
… | …100000010100010010111 |
3 | 21002012122221110121222021 |
4 | 131012300210002202113 |
5 | 230232222214431411 |
6 | 4130502100314011 |
7 | 264334613513233 |
oct | 35066044024227 |
9 | 7065587417867 |
10 | 2000122030231 |
11 | 701279819a16 |
12 | 2837789a2907 |
13 | 1167c291c400 |
14 | 6cb40b775c3 |
15 | 37063a84a71 |
hex | 1d1b0902897 |
2000122030231 has 12 divisors (see below), whose sum is σ = 2182345557480. Its totient is φ = 1832172831840.
The previous prime is 2000122030229. The next prime is 2000122030237. The reversal of 2000122030231 is 1320302210002.
It is not a de Polignac number, because 2000122030231 - 21 = 2000122030229 is a prime.
It is a super-2 number, since 2×20001220302312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000122030237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45149776 + ... + 45194053.
It is an arithmetic number, because the mean of its divisors is an integer number (181862129790).
Almost surely, 22000122030231 is an apocalyptic number.
2000122030231 is a deficient number, since it is larger than the sum of its proper divisors (182223527249).
2000122030231 is a wasteful number, since it uses less digits than its factorization.
2000122030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90343986 (or 90343973 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 2000122030231 its reverse (1320302210002), we get a palindrome (3320424240233).
The spelling of 2000122030231 in words is "two trillion, one hundred twenty-two million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •