Base | Representation |
---|---|
bin | 101110101010111110… |
… | …1100110111000011101 |
3 | 100120200221202202122001 |
4 | 1131111331212320131 |
5 | 3120230433224323 |
6 | 114013212522301 |
7 | 10145463602164 |
oct | 1352575467035 |
9 | 316627682561 |
10 | 100226461213 |
11 | 3956225182a |
12 | 17511780391 |
13 | 95b3700068 |
14 | 4bcb1703db |
15 | 291906e3ad |
hex | 1755f66e1d |
100226461213 has 8 divisors (see below), whose sum is σ = 106136197560. Its totient is φ = 94318287360.
The previous prime is 100226461207. The next prime is 100226461261. The reversal of 100226461213 is 312164622001.
It can be written as a sum of positive squares in 4 ways, for example, as 72952929604 + 27273531609 = 270098^2 + 165147^2 .
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-100226461213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100226464213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 257248 + ... + 516361.
It is an arithmetic number, because the mean of its divisors is an integer number (13267024695).
Almost surely, 2100226461213 is an apocalyptic number.
It is an amenable number.
100226461213 is a deficient number, since it is larger than the sum of its proper divisors (5909736347).
100226461213 is an equidigital number, since it uses as much as digits as its factorization.
100226461213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781247.
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 100226461213 in words is "one hundred billion, two hundred twenty-six million, four hundred sixty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •