Base | Representation |
---|---|
bin | 1101101111010010011110… |
… | …11111001011001101010100 |
3 | 10221222020210112100202111010 |
4 | 12313221033133023031110 |
5 | 12424443422141020000 |
6 | 144131132413012220 |
7 | 6235516555562433 |
oct | 667511737131524 |
9 | 127866715322433 |
10 | 30212133532500 |
11 | 9698991828867 |
12 | 347b392484070 |
13 | 13b1cb847754a |
14 | 7663bcac911a |
15 | 375d48598d50 |
hex | 1b7a4f7cb354 |
30212133532500 has 120 divisors (see below), whose sum is σ = 89331238003392. Its totient is φ = 7943096000000.
The previous prime is 30212133532411. The next prime is 30212133532577. The reversal of 30212133532500 is 523533121203.
It is a happy number.
It is a super-2 number, since 2×302121335325002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 27835701 + ... + 28900700.
Almost surely, 230212133532500 is an apocalyptic number.
30212133532500 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30212133532500 is an abundant number, since it is smaller than the sum of its proper divisors (59119104470892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30212133532500 is a wasteful number, since it uses less digits than its factorization.
30212133532500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56736499 (or 56736482 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 30212133532500 its reverse (523533121203), we get a palindrome (30735666653703).
The spelling of 30212133532500 in words is "thirty trillion, two hundred twelve billion, one hundred thirty-three million, five hundred thirty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •