Base | Representation |
---|---|
bin | 101110100111110111… |
… | …1001010001001101111 |
3 | 100120102200020002210212 |
4 | 1131033233022021233 |
5 | 3120022213311343 |
6 | 113555002053035 |
7 | 10143055021304 |
oct | 1351757121157 |
9 | 316380202725 |
10 | 100122010223 |
11 | 395092a01a4 |
12 | 174a27aa17b |
13 | 9597b8b641 |
14 | 4bbb3410ab |
15 | 290ecdac18 |
hex | 174fbca26f |
100122010223 has 8 divisors (see below), whose sum is σ = 101253816000. Its totient is φ = 98990356608.
The previous prime is 100122010211. The next prime is 100122010231. The reversal of 100122010223 is 322010221001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100122010223 - 26 = 100122010159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100122010198 and 100122010207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100122010243) 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 7 ways as a sum of consecutive naturals, for example, 1764803 + ... + 1820651.
It is an arithmetic number, because the mean of its divisors is an integer number (12656727000).
Almost surely, 2100122010223 is an apocalyptic number.
100122010223 is a deficient number, since it is larger than the sum of its proper divisors (1131805777).
100122010223 is an equidigital number, since it uses as much as digits as its factorization.
100122010223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76081.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100122010223 its reverse (322010221001), we get a palindrome (422132231224).
The spelling of 100122010223 in words is "one hundred billion, one hundred twenty-two million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •