Base | Representation |
---|---|
bin | 1100000001000011000011… |
… | …1010011100110110100000 |
3 | 1201210001211202101201002012 |
4 | 3000100300322130312200 |
5 | 3212431430322001032 |
6 | 44033323501412052 |
7 | 2532355101203051 |
oct | 300206072346640 |
9 | 51701752351065 |
10 | 13212140031392 |
11 | 4234267676195 |
12 | 1594726b6a028 |
13 | 74ab9015a803 |
14 | 339684576728 |
15 | 17da287dc6b2 |
hex | c0430e9cda0 |
13212140031392 has 12 divisors (see below), whose sum is σ = 26011400686866. Its totient is φ = 6606070015680.
The previous prime is 13212140031383. The next prime is 13212140031439. The reversal of 13212140031392 is 29313004121231.
It can be written as a sum of positive squares in only one way, i.e., 12658538557456 + 553601473936 = 3557884^2 + 744044^2 .
It is a super-2 number, since 2×132121400313922 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 412879375981 = 13212140031392 / (1 + 3 + 2 + 1 + 2 + 1 + 4 + 0 + 0 + 3 + 1 + 3 + 9 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206439687959 + ... + 206439688022.
Almost surely, 213212140031392 is an apocalyptic number.
It is an amenable number.
13212140031392 is a deficient number, since it is larger than the sum of its proper divisors (12799260655474).
13212140031392 is an equidigital number, since it uses as much as digits as its factorization.
13212140031392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412879375991 (or 412879375983 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 13212140031392 in words is "thirteen trillion, two hundred twelve billion, one hundred forty million, thirty-one thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •