Base | Representation |
---|---|
bin | 10011010000001001101… |
… | …010010011000000100000 |
3 | 11200110220222111200110102 |
4 | 103100021222103000200 |
5 | 133134012033310031 |
6 | 2451441110521532 |
7 | 164404320351524 |
oct | 23201152230040 |
9 | 4613828450412 |
10 | 1323012010016 |
11 | 4700a4874994 |
12 | 1944aa0662a8 |
13 | 979b4800008 |
14 | 480698c1d84 |
15 | 246343087cb |
hex | 13409a93020 |
1323012010016 has 48 divisors (see below), whose sum is σ = 2648338908768. Its totient is φ = 650472768000.
The previous prime is 1323012009971. The next prime is 1323012010031. The reversal of 1323012010016 is 6100102103231.
It is a self number, because there is not a number n which added to its sum of digits gives 1323012010016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82310 + ... + 1628741.
It is an arithmetic number, because the mean of its divisors is an integer number (55173727266).
Almost surely, 21323012010016 is an apocalyptic number.
1323012010016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1323012010016 is an abundant number, since it is smaller than the sum of its proper divisors (1325326898752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1323012010016 is a wasteful number, since it uses less digits than its factorization.
1323012010016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1711465 (or 1711457 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1323012010016 its reverse (6100102103231), we get a palindrome (7423114113247).
The spelling of 1323012010016 in words is "one trillion, three hundred twenty-three billion, twelve million, ten thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •