Base | Representation |
---|---|
bin | 101110100100011011… |
… | …0011000111101010001 |
3 | 100120010121210211001112 |
4 | 1131020312120331101 |
5 | 3114303123342421 |
6 | 113535313343105 |
7 | 10140152633645 |
oct | 1351066307521 |
9 | 316117724045 |
10 | 100006465361 |
11 | 3945a051680 |
12 | 1746bb67a95 |
13 | 9579c644ba |
14 | 4ba9c64c25 |
15 | 2904ab545b |
hex | 1748d98f51 |
100006465361 has 8 divisors (see below), whose sum is σ = 109274789664. Its totient is φ = 90767612320.
The previous prime is 100006465343. The next prime is 100006465381. The reversal of 100006465361 is 163564600001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-100006465361 is a prime.
It is a super-2 number, since 2×1000064653612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100006465381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7360715 + ... + 7374288.
It is an arithmetic number, because the mean of its divisors is an integer number (13659348708).
Almost surely, 2100006465361 is an apocalyptic number.
100006465361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100006465361 is a deficient number, since it is larger than the sum of its proper divisors (9268324303).
100006465361 is a wasteful number, since it uses less digits than its factorization.
100006465361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14735631.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 100006465361 in words is "one hundred billion, six million, four hundred sixty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •