Base | Representation |
---|---|
bin | 10011010000001001000… |
… | …100100000000011111101 |
3 | 11200110220021212022020100 |
4 | 103100021010200003331 |
5 | 133134002014231023 |
6 | 2451440114311313 |
7 | 164404140214314 |
oct | 23201104400375 |
9 | 4613807768210 |
10 | 1323002102013 |
11 | 47009a217959 |
12 | 1944a6888539 |
13 | 979b27412a7 |
14 | 4806846327b |
15 | 246334ecc43 |
hex | 134091200fd |
1323002102013 has 12 divisors (see below), whose sum is σ = 1929923859708. Its totient is φ = 873268713600.
The previous prime is 1323002101999. The next prime is 1323002102063. The reversal of 1323002102013 is 3102012003231.
1323002102013 is a `hidden beast` number, since 132 + 300 + 210 + 20 + 1 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 862886792889 + 460115309124 = 928917^2 + 678318^2 .
It is not a de Polignac number, because 1323002102013 - 237 = 1185563148541 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323002102063) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 727723020 + ... + 727724837.
It is an arithmetic number, because the mean of its divisors is an integer number (160826988309).
Almost surely, 21323002102013 is an apocalyptic number.
It is an amenable number.
1323002102013 is a deficient number, since it is larger than the sum of its proper divisors (606921757695).
1323002102013 is a wasteful number, since it uses less digits than its factorization.
1323002102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1455447964 (or 1455447961 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1323002102013 its reverse (3102012003231), we get a palindrome (4425014105244).
The spelling of 1323002102013 in words is "one trillion, three hundred twenty-three billion, two million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •