Base | Representation |
---|---|
bin | 1010111011010001000110… |
… | …1110111001000101000000 |
3 | 1120112110110222221122101000 |
4 | 2232310101232321011000 |
5 | 3033311240141011000 |
6 | 41314502110012000 |
7 | 2346635202634341 |
oct | 256642156710500 |
9 | 46473428848330 |
10 | 12013321032000 |
11 | 3911903599362 |
12 | 1420318aa7000 |
13 | 691b0b444442 |
14 | 2d763ac340c8 |
15 | 15c762638000 |
hex | aed11bb9140 |
12013321032000 has 224 divisors, whose sum is σ = 44075540845440. Its totient is φ = 3203552217600.
The previous prime is 12013321031977. The next prime is 12013321032007. The reversal of 12013321032000 is 23012331021.
12013321032000 is a `hidden beast` number, since 1 + 2 + 0 + 1 + 332 + 10 + 320 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013321032007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27592614 + ... + 28024613.
Almost surely, 212013321032000 is an apocalyptic number.
12013321032000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12013321032000 is an abundant number, since it is smaller than the sum of its proper divisors (32062219813440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12013321032000 is an equidigital number, since it uses as much as digits as its factorization.
12013321032000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55617263 (or 55617237 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 12013321032000 its reverse (23012331021), we get a palindrome (12036333363021).
The spelling of 12013321032000 in words is "twelve trillion, thirteen billion, three hundred twenty-one million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •