Base | Representation |
---|---|
bin | 10110101111100001101100… |
… | …101001100011110010111110 |
3 | 111010011002220022210211111101 |
4 | 112233201230221203302332 |
5 | 101102234121413114402 |
6 | 552421535215243314 |
7 | 30032265465253615 |
oct | 2657415451436276 |
9 | 433132808724441 |
10 | 100023021223102 |
11 | 2996358598189a |
12 | b27516b51953a |
13 | 43a7190726153 |
14 | 1a9b1d646687c |
15 | b86c658c2b87 |
hex | 5af86ca63cbe |
100023021223102 has 8 divisors (see below), whose sum is σ = 157931086141800. Its totient is φ = 47379325842504.
The previous prime is 100023021223067. The next prime is 100023021223117. The reversal of 100023021223102 is 201322120320001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1000230212231022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 100023021223102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1316092384477 + ... + 1316092384552.
It is an arithmetic number, because the mean of its divisors is an integer number (19741385767725).
Almost surely, 2100023021223102 is an apocalyptic number.
100023021223102 is a deficient number, since it is larger than the sum of its proper divisors (57908064918698).
100023021223102 is a wasteful number, since it uses less digits than its factorization.
100023021223102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2632184769050.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 100023021223102 its reverse (201322120320001), we get a palindrome (301345141543103).
The spelling of 100023021223102 in words is "one hundred trillion, twenty-three billion, twenty-one million, two hundred twenty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •