Base | Representation |
---|---|
bin | 11101000111000010010… |
… | …10101111001100001011 |
3 | 10112121201100202122212200 |
4 | 32203201022233030023 |
5 | 112341412241213003 |
6 | 2043253513411243 |
7 | 132156065403261 |
oct | 16434112571413 |
9 | 3477640678780 |
10 | 1000210101003 |
11 | 356206587993 |
12 | 141a20409b23 |
13 | 7341c97b669 |
14 | 365a62d8431 |
15 | 1b03ee186a3 |
hex | e8e12af30b |
1000210101003 has 12 divisors (see below), whose sum is σ = 1445244609120. Its totient is φ = 666577494576.
The previous prime is 1000210100983. The next prime is 1000210101029. The reversal of 1000210101003 is 3001010120001.
1000210101003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1000210101003 - 213 = 1000210092811 is a prime.
It is a super-2 number, since 2×10002101010032 (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 (1000210101403) 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, 19075651 + ... + 19128012.
It is an arithmetic number, because the mean of its divisors is an integer number (120437050760).
Almost surely, 21000210101003 is an apocalyptic number.
1000210101003 is a deficient number, since it is larger than the sum of its proper divisors (445034508117).
1000210101003 is a wasteful number, since it uses less digits than its factorization.
1000210101003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38206578 (or 38206575 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 1000210101003 its reverse (3001010120001), we get a palindrome (4001220221004).
The spelling of 1000210101003 in words is "one trillion, two hundred ten million, one hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •