Base | Representation |
---|---|
bin | 10001011101101011100… |
… | …010111111100101011001 |
3 | 11020201200001021100200012 |
4 | 101131223202333211121 |
5 | 124130301123223113 |
6 | 2315152440251305 |
7 | 152463413324333 |
oct | 21355342774531 |
9 | 4221601240605 |
10 | 1200100211033 |
11 | 422a61312129 |
12 | 174707170b35 |
13 | 892272a3589 |
14 | 42129972453 |
15 | 2133d8d2aa8 |
hex | 1176b8bf959 |
1200100211033 has 2 divisors, whose sum is σ = 1200100211034. Its totient is φ = 1200100211032.
The previous prime is 1200100211027. The next prime is 1200100211131. The reversal of 1200100211033 is 3301120010021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 974706001984 + 225394209049 = 987272^2 + 474757^2 .
It is a cyclic number.
It is not a de Polignac number, because 1200100211033 - 24 = 1200100211017 is a prime.
It is a super-2 number, since 2×12001002110332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1200100210999 and 1200100211017.
It is not a weakly prime, because it can be changed into another prime (1200100261033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600050105516 + 600050105517.
It is an arithmetic number, because the mean of its divisors is an integer number (600050105517).
Almost surely, 21200100211033 is an apocalyptic number.
It is an amenable number.
1200100211033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200100211033 is an equidigital number, since it uses as much as digits as its factorization.
1200100211033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1200100211033 its reverse (3301120010021), we get a palindrome (4501220221054).
The spelling of 1200100211033 in words is "one trillion, two hundred billion, one hundred million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •