Base | Representation |
---|---|
bin | 1011000000100011000001… |
… | …1110000011010001001000 |
3 | 1120212010121201210200200202 |
4 | 2300020300132003101020 |
5 | 3041303023420233300 |
6 | 41424303131551332 |
7 | 2356326113100113 |
oct | 260106036032110 |
9 | 46763551720622 |
10 | 12104031024200 |
11 | 3947321a64065 |
12 | 1435a135bb548 |
13 | 69a536393c3b |
14 | 2dbba414b57a |
15 | 15ecc0eacad5 |
hex | b0230783448 |
12104031024200 has 48 divisors (see below), whose sum is σ = 28538236560960. Its totient is φ = 4773420680000.
The previous prime is 12104031024187. The next prime is 12104031024223. The reversal of 12104031024200 is 242013040121.
It is a super-2 number, since 2×121040310242002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 426184076 + ... + 426212475.
It is an arithmetic number, because the mean of its divisors is an integer number (594546595020).
Almost surely, 212104031024200 is an apocalyptic number.
12104031024200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12104031024200 is an abundant number, since it is smaller than the sum of its proper divisors (16434205536760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12104031024200 is a wasteful number, since it uses less digits than its factorization.
12104031024200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852396638 (or 852396629 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12104031024200 its reverse (242013040121), we get a palindrome (12346044064321).
The spelling of 12104031024200 in words is "twelve trillion, one hundred four billion, thirty-one million, twenty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •