Base | Representation |
---|---|
bin | 1101101001001101010111… |
… | …11100000110011001000000 |
3 | 10221020021120202210210211112 |
4 | 12310212223330012121000 |
5 | 12413033104143040222 |
6 | 143451143311302452 |
7 | 6214443016332416 |
oct | 664465374063100 |
9 | 127207522723745 |
10 | 30003231221312 |
11 | 9618331929498 |
12 | 34469b151aa28 |
13 | 13983a59bc91b |
14 | 75a2425812b6 |
15 | 3706bd7e2be2 |
hex | 1b49abf06640 |
30003231221312 has 28 divisors (see below), whose sum is σ = 59538665509680. Its totient is φ = 15001362746496.
The previous prime is 30003231221239. The next prime is 30003231221347. The reversal of 30003231221312 is 21312213230003.
30003231221312 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×300032312213122 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95258 + ... + 7746969.
It is an arithmetic number, because the mean of its divisors is an integer number (2126380911060).
Almost surely, 230003231221312 is an apocalyptic number.
30003231221312 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30003231221312 is a deficient number, since it is larger than the sum of its proper divisors (29535434288368).
30003231221312 is an equidigital number, since it uses as much as digits as its factorization.
30003231221312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7902018 (or 7902008 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 30003231221312 its reverse (21312213230003), we get a palindrome (51315444451315).
The spelling of 30003231221312 in words is "thirty trillion, three billion, two hundred thirty-one million, two hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •