Base | Representation |
---|---|
bin | 101110100100100010… |
… | …0101101111001000000 |
3 | 100120010212212121222201 |
4 | 1131021010231321000 |
5 | 3114310104033440 |
6 | 113535530042544 |
7 | 10140226565455 |
oct | 1351104557100 |
9 | 316125777881 |
10 | 100010221120 |
11 | 39461187407 |
12 | 17471279454 |
13 | 957a97ab44 |
14 | 4baa56182c |
15 | 29050a819a |
hex | 174912de40 |
100010221120 has 56 divisors (see below), whose sum is σ = 238179483000. Its totient is φ = 39999025152.
The previous prime is 100010221099. The next prime is 100010221121. The reversal of 100010221120 is 21122010001.
It can be written as a sum of positive squares in 4 ways, for example, as 2586332736 + 97423888384 = 50856^2 + 312128^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 100010221097 and 100010221106.
It is not an unprimeable number, because it can be changed into a prime (100010221121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3476556 + ... + 3505204.
Almost surely, 2100010221120 is an apocalyptic number.
100010221120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100010221120 is an abundant number, since it is smaller than the sum of its proper divisors (138169261880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010221120 is a wasteful number, since it uses less digits than its factorization.
100010221120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39575 (or 39565 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100010221120 its reverse (21122010001), we get a palindrome (121132231121).
The spelling of 100010221120 in words is "one hundred billion, ten million, two hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •