Base | Representation |
---|---|
bin | 101110100100010001… |
… | …0011000100110001001 |
3 | 100120010020221101010222 |
4 | 1131020202120212021 |
5 | 3114300303033001 |
6 | 113535005115425 |
7 | 10140060232163 |
oct | 1351042304611 |
9 | 316106841128 |
10 | 100001221001 |
11 | 3945709a4a0 |
12 | 1746a258b75 |
13 | 9578b49426 |
14 | 4ba929b933 |
15 | 29043cb61b |
hex | 1748898989 |
100001221001 has 8 divisors (see below), whose sum is σ = 109100628000. Its totient is φ = 90903211840.
The previous prime is 100001220973. The next prime is 100001221037. The reversal of 100001221001 is 100122100001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001221001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100001221001.
It is not an unprimeable number, because it can be changed into a prime (100001221081) 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, 196976 + ... + 488673.
It is an arithmetic number, because the mean of its divisors is an integer number (13637578500).
Almost surely, 2100001221001 is an apocalyptic number.
100001221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100001221001 is a deficient number, since it is larger than the sum of its proper divisors (9099406999).
100001221001 is a wasteful number, since it uses less digits than its factorization.
100001221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698919.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100001221001 its reverse (100122100001), we get a palindrome (200123321002).
The spelling of 100001221001 in words is "one hundred billion, one million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •