Base | Representation |
---|---|
bin | 101110100100100010… |
… | …0010101010000011101 |
3 | 100120010212200111120201 |
4 | 1131021010111100131 |
5 | 3114310042321341 |
6 | 113535523543501 |
7 | 10140225665344 |
oct | 1351104252035 |
9 | 316125614521 |
10 | 100010120221 |
11 | 39461118620 |
12 | 1747122ab91 |
13 | 957a943c3b |
14 | 4baa536b5b |
15 | 2905088331 |
hex | 174911541d |
100010120221 has 8 divisors (see below), whose sum is σ = 109170889344. Its totient is φ = 90860841120.
The previous prime is 100010120219. The next prime is 100010120257. The reversal of 100010120221 is 122021010001.
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 100010120221 - 21 = 100010120219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100010120198 and 100010120207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010120261) 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, 2854296 + ... + 2889121.
It is an arithmetic number, because the mean of its divisors is an integer number (13646361168).
Almost surely, 2100010120221 is an apocalyptic number.
100010120221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100010120221 is a deficient number, since it is larger than the sum of its proper divisors (9160769123).
100010120221 is a wasteful number, since it uses less digits than its factorization.
100010120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5745011.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100010120221 its reverse (122021010001), we get a palindrome (222031130222).
The spelling of 100010120221 in words is "one hundred billion, ten million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •