Base | Representation |
---|---|
bin | 11101011001101100110… |
… | …10000010100000000011 |
3 | 10120120120200011212110211 |
4 | 32230312122002200003 |
5 | 113022422402011321 |
6 | 2052032053134551 |
7 | 132662305153150 |
oct | 16546632024003 |
9 | 3516520155424 |
10 | 1010230110211 |
11 | 35a488619133 |
12 | 14395802a457 |
13 | 743588534aa |
14 | 36c76d89227 |
15 | 1b42992a0e1 |
hex | eb36682803 |
1010230110211 has 8 divisors (see below), whose sum is σ = 1154556980064. Its totient is φ = 865905311040.
The previous prime is 1010230110203. The next prime is 1010230110221. The reversal of 1010230110211 is 1120110320101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010230110211 - 23 = 1010230110203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010230110191 and 1010230110200.
It is not an unprimeable number, because it can be changed into a prime (1010230110221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 727431 + ... + 1596751.
It is an arithmetic number, because the mean of its divisors is an integer number (144319622508).
Almost surely, 21010230110211 is an apocalyptic number.
1010230110211 is a deficient number, since it is larger than the sum of its proper divisors (144326869853).
1010230110211 is an equidigital number, since it uses as much as digits as its factorization.
1010230110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035341.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1010230110211 its reverse (1120110320101), we get a palindrome (2130340430312).
The spelling of 1010230110211 in words is "one trillion, ten billion, two hundred thirty million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •