Base | Representation |
---|---|
bin | 1001010001101101111111… |
… | …1110010010111001100011 |
3 | 1100010010000020100111202100 |
4 | 2110123133332102321203 |
5 | 2314104110030311321 |
6 | 33405453033421443 |
7 | 2101632520362510 |
oct | 224333776227143 |
9 | 40103006314670 |
10 | 10200010010211 |
11 | 328288881201a |
12 | 11889b686a883 |
13 | 58cb1a570aa8 |
14 | 27397c698307 |
15 | 12a4d41e3326 |
hex | 946dff92e63 |
10200010010211 has 48 divisors (see below), whose sum is σ = 16848957199360. Its totient is φ = 5824824307200.
The previous prime is 10200010010189. The next prime is 10200010010243. The reversal of 10200010010211 is 11201001000201.
It is a happy number.
It is not a de Polignac number, because 10200010010211 - 211 = 10200010008163 is a prime.
It is a super-3 number, since 3×102000100102113 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200010010193 and 10200010010202.
It is not an unprimeable number, because it can be changed into a prime (10200010010011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1053824070 + ... + 1053833748.
Almost surely, 210200010010211 is an apocalyptic number.
10200010010211 is a deficient number, since it is larger than the sum of its proper divisors (6648947189149).
10200010010211 is a wasteful number, since it uses less digits than its factorization.
10200010010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18736 (or 18733 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10200010010211 its reverse (11201001000201), we get a palindrome (21401011010412).
The spelling of 10200010010211 in words is "ten trillion, two hundred billion, ten million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •