Base | Representation |
---|---|
bin | 101111100010110110… |
… | …0110111110010111010 |
3 | 100202112121021102002201 |
4 | 1133011230313302322 |
5 | 3133100341402414 |
6 | 114523221220414 |
7 | 10243106135206 |
oct | 1370554676272 |
9 | 322477242081 |
10 | 102101122234 |
11 | 3a334470361 |
12 | 1795556170a |
13 | 9821c01337 |
14 | 4d2811db06 |
15 | 29c8924574 |
hex | 17c5b37cba |
102101122234 has 32 divisors (see below), whose sum is σ = 157923561600. Its totient is φ = 49477190400.
The previous prime is 102101122231. The next prime is 102101122243. The reversal of 102101122234 is 432221101201.
102101122234 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1021011222342 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102101122231) 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 15 ways as a sum of consecutive naturals, for example, 11140614 + ... + 11149774.
It is an arithmetic number, because the mean of its divisors is an integer number (4935111300).
Almost surely, 2102101122234 is an apocalyptic number.
102101122234 is a deficient number, since it is larger than the sum of its proper divisors (55822439366).
102101122234 is a wasteful number, since it uses less digits than its factorization.
102101122234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10086.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102101122234 its reverse (432221101201), we get a palindrome (534322223435).
It can be divided in two parts, 10 and 2101122234, that added together give a square (2101122244 = 458382).
The spelling of 102101122234 in words is "one hundred two billion, one hundred one million, one hundred twenty-two thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •