Base | Representation |
---|---|
bin | 10001011110100111101… |
… | …111001001011110000011 |
3 | 11020211021102102111011111 |
4 | 101132213233021132003 |
5 | 124134333131431321 |
6 | 2315440552224151 |
7 | 152530424542510 |
oct | 21364757113603 |
9 | 4224242374144 |
10 | 1201110030211 |
11 | 42342a332233 |
12 | 17494939b057 |
13 | 8935856ac10 |
14 | 421c3b18307 |
15 | 2139c3a35e1 |
hex | 117a7bc9783 |
1201110030211 has 64 divisors (see below), whose sum is σ = 1504056508416. Its totient is φ = 933944256000.
The previous prime is 1201110030193. The next prime is 1201110030269. The reversal of 1201110030211 is 1120300111021.
It is a happy number.
It is not a de Polignac number, because 1201110030211 - 211 = 1201110028163 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1201110030191 and 1201110030200.
It is not an unprimeable number, because it can be changed into a prime (1201110030271) 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 63 ways as a sum of consecutive naturals, for example, 804493581 + ... + 804495073.
It is an arithmetic number, because the mean of its divisors is an integer number (23500882944).
Almost surely, 21201110030211 is an apocalyptic number.
1201110030211 is a deficient number, since it is larger than the sum of its proper divisors (302946478205).
1201110030211 is a wasteful number, since it uses less digits than its factorization.
1201110030211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2252.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1201110030211 its reverse (1120300111021), we get a palindrome (2321410141232).
The spelling of 1201110030211 in words is "one trillion, two hundred one billion, one hundred ten million, thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •