Base | Representation |
---|---|
bin | 10011010000001001000… |
… | …000110010111111111001 |
3 | 11200110220020000222020221 |
4 | 103100021000302333321 |
5 | 133134001242143001 |
6 | 2451440041420041 |
7 | 164404126031344 |
oct | 23201100627771 |
9 | 4613806028227 |
10 | 1323001131001 |
11 | 470099714370 |
12 | 1944a649a621 |
13 | 979b2491324 |
14 | 4806828d45b |
15 | 246333aa1a1 |
hex | 13409032ff9 |
1323001131001 has 16 divisors (see below), whose sum is σ = 1447207649280. Its totient is φ = 1199450952720.
The previous prime is 1323001130989. The next prime is 1323001131007. The reversal of 1323001131001 is 1001311003231.
It is a cyclic number.
It is not a de Polignac number, because 1323001131001 - 29 = 1323001130489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1323001131007) 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, 63770236 + ... + 63790978.
It is an arithmetic number, because the mean of its divisors is an integer number (90450478080).
Almost surely, 21323001131001 is an apocalyptic number.
1323001131001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1323001131001 is a deficient number, since it is larger than the sum of its proper divisors (124206518279).
1323001131001 is a wasteful number, since it uses less digits than its factorization.
1323001131001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36276.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1323001131001 its reverse (1001311003231), we get a palindrome (2324312134232).
The spelling of 1323001131001 in words is "one trillion, three hundred twenty-three billion, one million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •