Base | Representation |
---|---|
bin | 1101101111110101110110… |
… | …01011010011011111000000 |
3 | 10222001001210201222221122012 |
4 | 12313322323023103133000 |
5 | 12430301313223211112 |
6 | 144143552421432052 |
7 | 6240061224164141 |
oct | 667727313233700 |
9 | 128031721887565 |
10 | 30231120132032 |
11 | 96a5a45211036 |
12 | 3482bb0b6b628 |
13 | 13b3a22c02721 |
14 | 7672a0575ac8 |
15 | 3765aa388022 |
hex | 1b7ebb2d37c0 |
30231120132032 has 56 divisors (see below), whose sum is σ = 61235009561232. Its totient is φ = 14803953408000.
The previous prime is 30231120132011. The next prime is 30231120132047. The reversal of 30231120132032 is 23023102113203.
It is a super-2 number, since 2×302311201320322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30231120131989 and 30231120132007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15707594 + ... + 17526857.
Almost surely, 230231120132032 is an apocalyptic number.
30231120132032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30231120132032 is an abundant number, since it is smaller than the sum of its proper divisors (31003889429200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30231120132032 is a wasteful number, since it uses less digits than its factorization.
30231120132032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33234757 (or 33234747 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 30231120132032 its reverse (23023102113203), we get a palindrome (53254222245235).
The spelling of 30231120132032 in words is "thirty trillion, two hundred thirty-one billion, one hundred twenty million, one hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •