Base | Representation |
---|---|
bin | 1101101111110111111000… |
… | …10000011101010101010010 |
3 | 10222001011121211112200211110 |
4 | 12313323330100131111102 |
5 | 12430311032233032010 |
6 | 144144253024154150 |
7 | 6240130253006655 |
oct | 667737420352522 |
9 | 128034554480743 |
10 | 30232212002130 |
11 | 96a6455583216 |
12 | 3483256768956 |
13 | 13b3b68197ac8 |
14 | 76736559989c |
15 | 376621165120 |
hex | 1b7efc41d552 |
30232212002130 has 64 divisors (see below), whose sum is σ = 79303624086528. Its totient is φ = 7342928148480.
The previous prime is 30232212002063. The next prime is 30232212002143. The reversal of 30232212002130 is 3120021223203.
It is a happy number.
It is a super-3 number, since 3×302322120021303 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30232212002097 and 30232212002106.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 956094627 + ... + 956126246.
It is an arithmetic number, because the mean of its divisors is an integer number (1239119126352).
Almost surely, 230232212002130 is an apocalyptic number.
30232212002130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30232212002130 is an abundant number, since it is smaller than the sum of its proper divisors (49071412084398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30232212002130 is a wasteful number, since it uses less digits than its factorization.
30232212002130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1912220931.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 30232212002130 its reverse (3120021223203), we get a palindrome (33352233225333).
The spelling of 30232212002130 in words is "thirty trillion, two hundred thirty-two billion, two hundred twelve million, two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •