Base | Representation |
---|---|
bin | 101110100111001110… |
… | …0000010100001001001 |
3 | 100120101011020002121122 |
4 | 1131032130002201021 |
5 | 3120001124033001 |
6 | 113552503045025 |
7 | 10142401561004 |
oct | 1351634024111 |
9 | 316334202548 |
10 | 100100221001 |
11 | 394a7a68680 |
12 | 17497440775 |
13 | 95934cca01 |
14 | 4bb84ac53b |
15 | 290ce34b1b |
hex | 174e702849 |
100100221001 has 8 divisors (see below), whose sum is σ = 109677100800. Its totient is φ = 90602817840.
The previous prime is 100100220991. The next prime is 100100221009. The reversal of 100100221001 is 100122001001.
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 100100221001 - 230 = 99026479177 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 100100221001.
It is not an unprimeable number, because it can be changed into a prime (100100221009) 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, 19866521 + ... + 19871558.
It is an arithmetic number, because the mean of its divisors is an integer number (13709637600).
Almost surely, 2100100221001 is an apocalyptic number.
100100221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100100221001 is a deficient number, since it is larger than the sum of its proper divisors (9576879799).
100100221001 is a wasteful number, since it uses less digits than its factorization.
100100221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39738319.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100100221001 its reverse (100122001001), we get a palindrome (200222222002).
The spelling of 100100221001 in words is "one hundred billion, one hundred million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •