Base | Representation |
---|---|
bin | 10011010000100010101… |
… | …101100100111010101001 |
3 | 11200112000021100122012120 |
4 | 103100202231210322221 |
5 | 133140342132101301 |
6 | 2451550523101453 |
7 | 164420612641404 |
oct | 23204255447251 |
9 | 4615007318176 |
10 | 1323432300201 |
11 | 4702a0039150 |
12 | 1945a6971889 |
13 | 97a508c6b2b |
14 | 480a9648d3b |
15 | 2465b178e36 |
hex | 13422b64ea9 |
1323432300201 has 16 divisors (see below), whose sum is σ = 1944051772608. Its totient is φ = 794138792000.
The previous prime is 1323432300173. The next prime is 1323432300277. The reversal of 1323432300201 is 1020032343231.
It is a cyclic number.
It is not a de Polignac number, because 1323432300201 - 26 = 1323432300137 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1323432300301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198531366 + ... + 198538031.
It is an arithmetic number, because the mean of its divisors is an integer number (121503235788).
Almost surely, 21323432300201 is an apocalyptic number.
1323432300201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1323432300201 is a deficient number, since it is larger than the sum of its proper divisors (620619472407).
1323432300201 is a wasteful number, since it uses less digits than its factorization.
1323432300201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397069512.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 1323432300201 its reverse (1020032343231), we get a palindrome (2343464643432).
The spelling of 1323432300201 in words is "one trillion, three hundred twenty-three billion, four hundred thirty-two million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •