Base | Representation |
---|---|
bin | 10011000100000010001… |
… | …001010011110001100011 |
3 | 11122020100020000220112102 |
4 | 103010002021103301203 |
5 | 132430340230120003 |
6 | 2441450044121015 |
7 | 163434021642164 |
oct | 23040211236143 |
9 | 4566306026472 |
10 | 1310001020003 |
11 | 465628473585 |
12 | 191a7883616b |
13 | 966c0080c60 |
14 | 475938d576b |
15 | 24121e35588 |
hex | 13102253c63 |
1310001020003 has 4 divisors (see below), whose sum is σ = 1410770329248. Its totient is φ = 1209231710760.
The previous prime is 1310001019997. The next prime is 1310001020117. The reversal of 1310001020003 is 3000201000131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1310001020003 - 216 = 1310000954467 is a prime.
It is a super-2 number, since 2×13100010200032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310001320003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50384654603 + ... + 50384654628.
It is an arithmetic number, because the mean of its divisors is an integer number (352692582312).
Almost surely, 21310001020003 is an apocalyptic number.
1310001020003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1310001020003 is a deficient number, since it is larger than the sum of its proper divisors (100769309245).
1310001020003 is a wasteful number, since it uses less digits than its factorization.
1310001020003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100769309244.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 1310001020003 its reverse (3000201000131), we get a palindrome (4310202020134).
The spelling of 1310001020003 in words is "one trillion, three hundred ten billion, one million, twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •