Base | Representation |
---|---|
bin | 1100000010001101110101… |
… | …0110110010111011001010 |
3 | 1201211222122200020210010201 |
4 | 3000203131112302323022 |
5 | 3213244033012342140 |
6 | 44050443355202414 |
7 | 2533665400546645 |
oct | 300433526627312 |
9 | 51758580223121 |
10 | 13232213012170 |
11 | 42418283117a9 |
12 | 15985a944640a |
13 | 74ca3b9a8929 |
14 | 33a62a418a5c |
15 | 17e300b7249a |
hex | c08dd5b2eca |
13232213012170 has 8 divisors (see below), whose sum is σ = 23817983421924. Its totient is φ = 5292885204864.
The previous prime is 13232213012119. The next prime is 13232213012171. The reversal of 13232213012170 is 7121031223231.
13232213012170 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 12278303329681 + 953909682489 = 3504041^2 + 976683^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×132322130121702 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13232213012171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 661610650599 + ... + 661610650618.
Almost surely, 213232213012170 is an apocalyptic number.
13232213012170 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13232213012170 is a deficient number, since it is larger than the sum of its proper divisors (10585770409754).
13232213012170 is a wasteful number, since it uses less digits than its factorization.
13232213012170 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1323221301224.
The product of its (nonzero) digits is 3024, while the sum is 28.
The spelling of 13232213012170 in words is "thirteen trillion, two hundred thirty-two billion, two hundred thirteen million, twelve thousand, one hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •