Base | Representation |
---|---|
bin | 101110110000110001… |
… | …0010010100010101001 |
3 | 100121012111010101110201 |
4 | 1131201202102202221 |
5 | 3121130140022401 |
6 | 114044350312201 |
7 | 10153342146061 |
oct | 1354142224251 |
9 | 317174111421 |
10 | 100420626601 |
11 | 3965190a099 |
12 | 175667b8661 |
13 | 96149c3719 |
14 | 4c08c743a1 |
15 | 292b124b01 |
hex | 17618928a9 |
100420626601 has 4 divisors (see below), whose sum is σ = 100421352900. Its totient is φ = 100419900304.
The previous prime is 100420626571. The next prime is 100420626637. The reversal of 100420626601 is 106626024001.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 78974488576 + 21446138025 = 281024^2 + 146445^2 .
It is a cyclic number.
It is not a de Polignac number, because 100420626601 - 213 = 100420618409 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 100420626601.
It is not an unprimeable number, because it can be changed into a prime (100420626661) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84466 + ... + 456043.
It is an arithmetic number, because the mean of its divisors is an integer number (25105338225).
Almost surely, 2100420626601 is an apocalyptic number.
It is an amenable number.
100420626601 is a deficient number, since it is larger than the sum of its proper divisors (726299).
100420626601 is an equidigital number, since it uses as much as digits as its factorization.
100420626601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726298.
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 100420626601 in words is "one hundred billion, four hundred twenty million, six hundred twenty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •