Base | Representation |
---|---|
bin | 1001010010010011001110… |
… | …0110100001101011000111 |
3 | 1100011001210122220222200112 |
4 | 2110210303212201223013 |
5 | 2314240041232000012 |
6 | 33414224410103235 |
7 | 2102435251366526 |
oct | 224446346415307 |
9 | 40131718828615 |
10 | 10210003000007 |
11 | 3287046579178 |
12 | 118a92541ab1b |
13 | 590a509754c5 |
14 | 2742499144bd |
15 | 12a8bb669122 |
hex | 949339a1ac7 |
10210003000007 has 2 divisors, whose sum is σ = 10210003000008. Its totient is φ = 10210003000006.
The previous prime is 10210002999997. The next prime is 10210003000037. The reversal of 10210003000007 is 70000030001201.
It is a weak prime.
It is an emirp because it is prime and its reverse (70000030001201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10210003000007 - 28 = 10210002999751 is a prime.
It is a super-2 number, since 2×102100030000072 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10210002999955 and 10210003000000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210003000037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105001500003 + 5105001500004.
It is an arithmetic number, because the mean of its divisors is an integer number (5105001500004).
Almost surely, 210210003000007 is an apocalyptic number.
10210003000007 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210003000007 is an equidigital number, since it uses as much as digits as its factorization.
10210003000007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 14.
Adding to 10210003000007 its reverse (70000030001201), we get a palindrome (80210033001208).
The spelling of 10210003000007 in words is "ten trillion, two hundred ten billion, three million, seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •