Base | Representation |
---|---|
bin | 101110100100100001… |
… | …1111101010001110000 |
3 | 100120010212111111211220 |
4 | 1131021003331101300 |
5 | 3114310031201000 |
6 | 113535521505040 |
7 | 10140225106110 |
oct | 1351103752160 |
9 | 316125444756 |
10 | 100010022000 |
11 | 39461060849 |
12 | 174711a2180 |
13 | 957a90b315 |
14 | 4baa50d040 |
15 | 29050691a0 |
hex | 17490fd470 |
100010022000 has 160 divisors (see below), whose sum is σ = 368494224384. Its totient is φ = 22859424000.
The previous prime is 100010021987. The next prime is 100010022001. The reversal of 100010022000 is 220010001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 100010022000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010022001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1148596 + ... + 1232595.
Almost surely, 2100010022000 is an apocalyptic number.
100010022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100010022000 is an abundant number, since it is smaller than the sum of its proper divisors (268484202384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010022000 is a wasteful number, since it uses less digits than its factorization.
100010022000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2381224 (or 2381208 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 100010022000 its reverse (220010001), we get a palindrome (100230032001).
The spelling of 100010022000 in words is "one hundred billion, ten million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •