Base | Representation |
---|---|
bin | 10011000110110101000… |
… | …001001110100001011011 |
3 | 11122112002100221122201200 |
4 | 103012311001032201123 |
5 | 133003012004214003 |
6 | 2443103530045243 |
7 | 163601262023106 |
oct | 23066501164133 |
9 | 4575070848650 |
10 | 1313002023003 |
11 | 466928459550 |
12 | 192575879823 |
13 | 96a7aa26b88 |
14 | 4779a2bd73d |
15 | 2424a6266a3 |
hex | 131b504e85b |
1313002023003 has 24 divisors (see below), whose sum is σ = 2074901228400. Its totient is φ = 793478669760.
The previous prime is 1313002023001. The next prime is 1313002023013. The reversal of 1313002023003 is 3003202003131.
1313002023003 is a `hidden beast` number, since 131 + 30 + 0 + 202 + 300 + 3 = 666.
It is not a de Polignac number, because 1313002023003 - 21 = 1313002023001 is a prime.
It is a super-2 number, since 2×13130020230032 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1313002023001) 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 23 ways as a sum of consecutive naturals, for example, 18966376 + ... + 19035477.
It is an arithmetic number, because the mean of its divisors is an integer number (86454217850).
Almost surely, 21313002023003 is an apocalyptic number.
1313002023003 is a deficient number, since it is larger than the sum of its proper divisors (761899205397).
1313002023003 is a wasteful number, since it uses less digits than its factorization.
1313002023003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38002219 (or 38002216 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 1313002023003 its reverse (3003202003131), we get a palindrome (4316204026134).
The spelling of 1313002023003 in words is "one trillion, three hundred thirteen billion, two million, twenty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •