Base | Representation |
---|---|
bin | 11110111111101110100… |
… | …110111111111011000111 |
3 | 21112121221012101101021100 |
4 | 132333232212333323013 |
5 | 234344231033342411 |
6 | 4310303005351143 |
7 | 306613453242345 |
oct | 36775646777307 |
9 | 7477835341240 |
10 | 2130012012231 |
11 | 751373284984 |
12 | 2a49888684b3 |
13 | 125b22a8361c |
14 | 751437a4995 |
15 | 3a616e15456 |
hex | 1efee9bfec7 |
2130012012231 has 6 divisors (see below), whose sum is σ = 3076684017680. Its totient is φ = 1420008008148.
The previous prime is 2130012012217. The next prime is 2130012012257. The reversal of 2130012012231 is 1322102100312.
2130012012231 is a `hidden beast` number, since 2 + 1 + 300 + 120 + 12 + 231 = 666.
It is not a de Polignac number, because 2130012012231 - 29 = 2130012011719 is a prime.
It is a super-2 number, since 2×21300120122312 (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 (2130012012431) 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 5 ways as a sum of consecutive naturals, for example, 118334000671 + ... + 118334000688.
Almost surely, 22130012012231 is an apocalyptic number.
2130012012231 is a deficient number, since it is larger than the sum of its proper divisors (946672005449).
2130012012231 is a wasteful number, since it uses less digits than its factorization.
2130012012231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236668001365 (or 236668001362 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2130012012231 its reverse (1322102100312), we get a palindrome (3452114112543).
The spelling of 2130012012231 in words is "two trillion, one hundred thirty billion, twelve million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •