Base | Representation |
---|---|
bin | 101110100100010001… |
… | …0000000101011001101 |
3 | 100120010020202101202002 |
4 | 1131020202000223031 |
5 | 3114300241414041 |
6 | 113535003042045 |
7 | 10140056343422 |
oct | 1351042005315 |
9 | 316106671662 |
10 | 100001123021 |
11 | 39457032918 |
12 | 1746a210325 |
13 | 9578b13957 |
14 | 4ba9273d49 |
15 | 29043ac59b |
hex | 1748880acd |
100001123021 has 8 divisors (see below), whose sum is σ = 102444398784. Its totient is φ = 97558048480.
The previous prime is 100001123011. The next prime is 100001123071. The reversal of 100001123021 is 120321100001.
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 100001123021 - 26 = 100001122957 is a prime.
It is a super-2 number, since 2×1000011230212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100001122993 and 100001123011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001123011) 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, 1643870 + ... + 1703616.
It is an arithmetic number, because the mean of its divisors is an integer number (12805549848).
Almost surely, 2100001123021 is an apocalyptic number.
It is an amenable number.
100001123021 is a deficient number, since it is larger than the sum of its proper divisors (2443275763).
100001123021 is an equidigital number, since it uses as much as digits as its factorization.
100001123021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100611.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 100001123021 its reverse (120321100001), we get a palindrome (220322223022).
The spelling of 100001123021 in words is "one hundred billion, one million, one hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •