Base | Representation |
---|---|
bin | 1010111010101010101101… |
… | …0001110111100100001000 |
3 | 1120111110212120002101012220 |
4 | 2232222223101313210020 |
5 | 3033124132111304000 |
6 | 41310035132134040 |
7 | 2346121555262424 |
oct | 256525321674410 |
9 | 46443776071186 |
10 | 12003012213000 |
11 | 39084a3527036 |
12 | 141a320607320 |
13 | 690b5778c043 |
14 | 2d6d3da83b84 |
15 | 15c35c5c81a0 |
hex | aeaab477908 |
12003012213000 has 128 divisors (see below), whose sum is σ = 37453279893120. Its totient is φ = 3200471481600.
The previous prime is 12003012212993. The next prime is 12003012213109. The reversal of 12003012213000 is 31221030021.
12003012213000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 29446582 + ... + 29851418.
It is an arithmetic number, because the mean of its divisors is an integer number (292603749165).
Almost surely, 212003012213000 is an apocalyptic number.
12003012213000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12003012213000 is an abundant number, since it is smaller than the sum of its proper divisors (25450267680120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12003012213000 is a wasteful number, since it uses less digits than its factorization.
12003012213000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414744 (or 414730 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 12003012213000 its reverse (31221030021), we get a palindrome (12034233243021).
The spelling of 12003012213000 in words is "twelve trillion, three billion, twelve million, two hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •