Base | Representation |
---|---|
bin | 10001011101100110110… |
… | …001000001100011000101 |
3 | 11020201110110100100221210 |
4 | 101131212301001203011 |
5 | 124130120110044023 |
6 | 2315140453202033 |
7 | 152461420503606 |
oct | 21354661014305 |
9 | 4221413310853 |
10 | 1200020003013 |
11 | 422a20009707 |
12 | 1746a4330319 |
13 | 8921379c600 |
14 | 4211d053dad |
15 | 2133683c593 |
hex | 11766c418c5 |
1200020003013 has 36 divisors (see below), whose sum is σ = 1828560975840. Its totient is φ = 699606696672.
The previous prime is 1200020003011. The next prime is 1200020003027. The reversal of 1200020003013 is 3103000200021.
It is a happy number.
It is not a de Polignac number, because 1200020003013 - 21 = 1200020003011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1200020003013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200020003011) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3095233 + ... + 3461286.
It is an arithmetic number, because the mean of its divisors is an integer number (50793360440).
Almost surely, 21200020003013 is an apocalyptic number.
1200020003013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1200020003013 is a deficient number, since it is larger than the sum of its proper divisors (628540972827).
1200020003013 is a wasteful number, since it uses less digits than its factorization.
1200020003013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6556586 (or 6556554 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 1200020003013 its reverse (3103000200021), we get a palindrome (4303020203034).
The spelling of 1200020003013 in words is "one trillion, two hundred billion, twenty million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •