Base | Representation |
---|---|
bin | 1011110000111011010… |
… | …0001000011110001011 |
3 | 201022200112101220201120 |
4 | 2330032310020132023 |
5 | 11302411133310443 |
6 | 232503213450323 |
7 | 20413344511632 |
oct | 2741664103613 |
9 | 638615356646 |
10 | 202112010123 |
11 | 78795a62711 |
12 | 33206aa09a3 |
13 | 1609ca537ca |
14 | 9ad47b6519 |
15 | 53cdab0083 |
hex | 2f0ed0878b |
202112010123 has 32 divisors (see below), whose sum is σ = 296933644800. Its totient is φ = 121714281216.
The previous prime is 202112010119. The next prime is 202112010173. The reversal of 202112010123 is 321010211202.
202112010123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202112010123 - 22 = 202112010119 is a prime.
It is not an unprimeable number, because it can be changed into a prime (202112010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 172423 + ... + 658751.
It is an arithmetic number, because the mean of its divisors is an integer number (9279176400).
Almost surely, 2202112010123 is an apocalyptic number.
202112010123 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
202112010123 is a deficient number, since it is larger than the sum of its proper divisors (94821634677).
202112010123 is a wasteful number, since it uses less digits than its factorization.
202112010123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486691.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 202112010123 its reverse (321010211202), we get a palindrome (523122221325).
The spelling of 202112010123 in words is "two hundred two billion, one hundred twelve million, ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •