Base | Representation |
---|---|
bin | 101110101011000101… |
… | …1111000001011111111 |
3 | 100120201012210211011211 |
4 | 1131112023320023333 |
5 | 3120232412431421 |
6 | 114013425025251 |
7 | 10145540442454 |
oct | 1352613701377 |
9 | 316635724154 |
10 | 100230202111 |
11 | 39564377386 |
12 | 17512a85227 |
13 | 95b440ca00 |
14 | 4bcb86582b |
15 | 291955c9e1 |
hex | 17562f82ff |
100230202111 has 6 divisors (see below), whose sum is σ = 108533295960. Its totient is φ = 92520186408.
The previous prime is 100230202099. The next prime is 100230202133. The reversal of 100230202111 is 111202032001.
It is not a de Polignac number, because 100230202111 - 215 = 100230169343 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100230202091 and 100230202100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100230202411) 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 5 ways as a sum of consecutive naturals, for example, 296538891 + ... + 296539228.
It is an arithmetic number, because the mean of its divisors is an integer number (18088882660).
Almost surely, 2100230202111 is an apocalyptic number.
100230202111 is a deficient number, since it is larger than the sum of its proper divisors (8303093849).
100230202111 is an equidigital number, since it uses as much as digits as its factorization.
100230202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593078145 (or 593078132 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100230202111 its reverse (111202032001), we get a palindrome (211432234112).
The spelling of 100230202111 in words is "one hundred billion, two hundred thirty million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •