Base | Representation |
---|---|
bin | 10001011101101011101… |
… | …101101011101010010011 |
3 | 11020201200020112201021011 |
4 | 101131223231223222103 |
5 | 124130302332404021 |
6 | 2315153020311351 |
7 | 152463446204350 |
oct | 21355355535223 |
9 | 4221606481234 |
10 | 1200103013011 |
11 | 422a62956311 |
12 | 1747080a2557 |
13 | 89227a44a56 |
14 | 4212a0a1627 |
15 | 2133dc87de1 |
hex | 1176bb6ba93 |
1200103013011 has 8 divisors (see below), whose sum is σ = 1452225494880. Its totient is φ = 968150329728.
The previous prime is 1200103013009. The next prime is 1200103013059. The reversal of 1200103013011 is 1103103010021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1200103013011 - 21 = 1200103013009 is a prime.
It is a super-2 number, since 2×12001030130112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200103012982 and 1200103013000.
It is not an unprimeable number, because it can be changed into a prime (1200103010011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5042449516 + ... + 5042449753.
It is an arithmetic number, because the mean of its divisors is an integer number (181528186860).
Almost surely, 21200103013011 is an apocalyptic number.
1200103013011 is a deficient number, since it is larger than the sum of its proper divisors (252122481869).
1200103013011 is a wasteful number, since it uses less digits than its factorization.
1200103013011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10084899293.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1200103013011 its reverse (1103103010021), we get a palindrome (2303206023032).
The spelling of 1200103013011 in words is "one trillion, two hundred billion, one hundred three million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •