Base | Representation |
---|---|
bin | 10011010000010100111… |
… | …111001000111100111111 |
3 | 11200111102020001100120220 |
4 | 103100110333020330333 |
5 | 133134404204220411 |
6 | 2451512015312423 |
7 | 164412115423104 |
oct | 23202477107477 |
9 | 4614366040526 |
10 | 1323202023231 |
11 | 470192056700 |
12 | 19454181b713 |
13 | 97a14c9b77a |
14 | 48086c24aab |
15 | 24645d3db06 |
hex | 13414fc8f3f |
1323202023231 has 48 divisors (see below), whose sum is σ = 2061515406720. Its totient is φ = 752210712000.
The previous prime is 1323202023229. The next prime is 1323202023257.
1323202023231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1323202023231 - 21 = 1323202023229 is a prime.
It is a super-2 number, since 2×13232020232312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323202023211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 253165 + ... + 1646358.
It is an arithmetic number, because the mean of its divisors is an integer number (42948237640).
Almost surely, 21323202023231 is an apocalyptic number.
1323202023231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1323202023231 is a deficient number, since it is larger than the sum of its proper divisors (738313383489).
1323202023231 is a wasteful number, since it uses less digits than its factorization.
1323202023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1899668 (or 1899657 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
The spelling of 1323202023231 in words is "one trillion, three hundred twenty-three billion, two hundred two million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •