Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1000101010110010011 |
3 | 100202022022200201221000 |
4 | 1133000111011112103 |
5 | 3132404304001321 |
6 | 114510241433043 |
7 | 10240633123611 |
oct | 1370025052623 |
9 | 322268621830 |
10 | 102011000211 |
11 | 3a29860634a |
12 | 1792b33b783 |
13 | 98093389b3 |
14 | 4d1a1806b1 |
15 | 29c0a71826 |
hex | 17c0545593 |
102011000211 has 16 divisors (see below), whose sum is σ = 154342886400. Its totient is φ = 66560368104.
The previous prime is 102011000137. The next prime is 102011000233. The reversal of 102011000211 is 112000110201.
It is a happy number.
It is not a de Polignac number, because 102011000211 - 229 = 101474129299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102011000193 and 102011000202.
It is not an unprimeable number, because it can be changed into a prime (102011005211) 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 15 ways as a sum of consecutive naturals, for example, 40192191 + ... + 40194728.
It is an arithmetic number, because the mean of its divisors is an integer number (9646430400).
Almost surely, 2102011000211 is an apocalyptic number.
102011000211 is a deficient number, since it is larger than the sum of its proper divisors (52331886189).
102011000211 is an equidigital number, since it uses as much as digits as its factorization.
102011000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80386975 (or 80386969 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102011000211 its reverse (112000110201), we get a palindrome (214011110412).
The spelling of 102011000211 in words is "one hundred two billion, eleven million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •