Base | Representation |
---|---|
bin | 11101100010101101001… |
… | …100001010110110001000 |
3 | 21012002010021011012221110 |
4 | 131202231030022312020 |
5 | 231230201313242412 |
6 | 4152343504010320 |
7 | 266446343040303 |
oct | 35425514126610 |
9 | 7162107135843 |
10 | 2030130212232 |
11 | 712a78641231 |
12 | 2895526009a0 |
13 | 1195958ba715 |
14 | 7038a311b3a |
15 | 37c1d277d3c |
hex | 1d8ad30ad88 |
2030130212232 has 32 divisors (see below), whose sum is σ = 5161348000800. Its totient is φ = 665240408064.
The previous prime is 2030130212221. The next prime is 2030130212239. The reversal of 2030130212232 is 2322120310302.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2030130212199 and 2030130212208.
It is not an unprimeable number, because it can be changed into a prime (2030130212239) 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 7 ways as a sum of consecutive naturals, for example, 716852473 + ... + 716855304.
It is an arithmetic number, because the mean of its divisors is an integer number (161292125025).
Almost surely, 22030130212232 is an apocalyptic number.
It is an amenable number.
2030130212232 is an abundant number, since it is smaller than the sum of its proper divisors (3131217788568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2030130212232 is a wasteful number, since it uses less digits than its factorization.
2030130212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1433707845 (or 1433707841 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2030130212232 its reverse (2322120310302), we get a palindrome (4352250522534).
The spelling of 2030130212232 in words is "two trillion, thirty billion, one hundred thirty million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •