Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …00101001000110001011 |
3 | 10112200210210220220222200 |
4 | 32210101130221012023 |
5 | 112400042121213003 |
6 | 2043510130451243 |
7 | 132215132316306 |
oct | 16442134510613 |
9 | 3480723826880 |
10 | 1001020101003 |
11 | 35659182897a |
12 | 142007733b23 |
13 | 7351b7230c0 |
14 | 36641b07b3d |
15 | 1b08b0b86a3 |
hex | e91172918b |
1001020101003 has 24 divisors (see below), whose sum is σ = 1557180665040. Its totient is φ = 615997224000.
The previous prime is 1001020100999. The next prime is 1001020101013. The reversal of 1001020101003 is 3001010201001.
It is not a de Polignac number, because 1001020101003 - 22 = 1001020100999 is a prime.
It is a super-2 number, since 2×10010201010032 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1001020101013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6370128 + ... + 6525378.
It is an arithmetic number, because the mean of its divisors is an integer number (64882527710).
Almost surely, 21001020101003 is an apocalyptic number.
1001020101003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1001020101003 is a deficient number, since it is larger than the sum of its proper divisors (556160564037).
1001020101003 is a wasteful number, since it uses less digits than its factorization.
1001020101003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210379 (or 210376 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 1001020101003 its reverse (3001010201001), we get a palindrome (4002030302004).
The spelling of 1001020101003 in words is "one trillion, one billion, twenty million, one hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •