Base | Representation |
---|---|
bin | 11101011100111111110… |
… | …10011001011000001001 |
3 | 10120202011000220202110100 |
4 | 32232133322121120021 |
5 | 113040034022401301 |
6 | 2052523444240013 |
7 | 133054210525314 |
oct | 16563772313011 |
9 | 3522130822410 |
10 | 1012000200201 |
11 | 360206803a21 |
12 | 1441709a0009 |
13 | 7457b4a0513 |
14 | 36da40b797b |
15 | 1b4d0026286 |
hex | eb9fe99609 |
1012000200201 has 12 divisors (see below), whose sum is σ = 1463545644912. Its totient is φ = 673850994936.
The previous prime is 1012000200199. The next prime is 1012000200209. The reversal of 1012000200201 is 1020020002101.
It is not a de Polignac number, because 1012000200201 - 21 = 1012000200199 is a prime.
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 (1012000200209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 67975911 + ... + 67990796.
It is an arithmetic number, because the mean of its divisors is an integer number (121962137076).
Almost surely, 21012000200201 is an apocalyptic number.
It is an amenable number.
1012000200201 is a deficient number, since it is larger than the sum of its proper divisors (451545444711).
1012000200201 is a wasteful number, since it uses less digits than its factorization.
1012000200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135967540 (or 135967537 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1012000200201 its reverse (1020020002101), we get a palindrome (2032020202302).
It can be divided in two parts, 1012000 and 200201, that added together give a square (1212201 = 11012).
The spelling of 1012000200201 in words is "one trillion, twelve billion, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •