Base | Representation |
---|---|
bin | 101110100100001110… |
… | …1110011111100100110 |
3 | 100120010011200110212000 |
4 | 1131020131303330212 |
5 | 3114300001203220 |
6 | 113534523310130 |
7 | 10140044110356 |
oct | 1351035637446 |
9 | 316104613760 |
10 | 100000022310 |
11 | 39456450941 |
12 | 1746997b346 |
13 | 9578819946 |
14 | 4ba9068b66 |
15 | 2904241390 |
hex | 1748773f26 |
100000022310 has 32 divisors (see below), whose sum is σ = 266666726880. Its totient is φ = 26666672544.
The previous prime is 100000022281. The next prime is 100000022321. The reversal of 100000022310 is 13220000001.
It is a happy number.
It is a super-2 number, since 2×1000000223102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100000022292 and 100000022301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 185184957 + ... + 185185496.
It is an arithmetic number, because the mean of its divisors is an integer number (8333335215).
Almost surely, 2100000022310 is an apocalyptic number.
100000022310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000022310 is an abundant number, since it is smaller than the sum of its proper divisors (166666704570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000022310 is a wasteful number, since it uses less digits than its factorization.
100000022310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370370469 (or 370370463 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 100000022310 its reverse (13220000001), we get a palindrome (113220022311).
The spelling of 100000022310 in words is "one hundred billion, twenty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •