Base | Representation |
---|---|
bin | 101111100011001001… |
… | …1011001001000000110 |
3 | 100202120022021102221120 |
4 | 1133012103121020012 |
5 | 3133110433021410 |
6 | 114524221454410 |
7 | 10243261023345 |
oct | 1370623311006 |
9 | 322508242846 |
10 | 102111220230 |
11 | 3a33a138108 |
12 | 17958a11406 |
13 | 9824028696 |
14 | 4d295cbb5c |
15 | 29c976b570 |
hex | 17c64d9206 |
102111220230 has 64 divisors (see below), whose sum is σ = 257119543296. Its totient is φ = 25919280000.
The previous prime is 102111220223. The next prime is 102111220333. The reversal of 102111220230 is 32022111201.
It is a super-2 number, since 2×1021112202302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 843246 + ... + 956705.
It is an arithmetic number, because the mean of its divisors is an integer number (4017492864).
Almost surely, 2102111220230 is an apocalyptic number.
102111220230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102111220230 is an abundant number, since it is smaller than the sum of its proper divisors (155008323066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111220230 is a wasteful number, since it uses less digits than its factorization.
102111220230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1800053.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102111220230 its reverse (32022111201), we get a palindrome (134133331431).
The spelling of 102111220230 in words is "one hundred two billion, one hundred eleven million, two hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •