Base | Representation |
---|---|
bin | 10010110001010011… |
… | …10101000100101111 |
3 | 222000022012121210021 |
4 | 21120221311010233 |
5 | 131114241414040 |
6 | 4343543223011 |
7 | 504503410333 |
oct | 113051650457 |
9 | 28008177707 |
10 | 10077294895 |
11 | 4301408898 |
12 | 1b52a47a67 |
13 | c47a114b5 |
14 | 6b85237c3 |
15 | 3dea7a24a |
hex | 258a7512f |
10077294895 has 8 divisors (see below), whose sum is σ = 12106454256. Its totient is φ = 8052702336.
The previous prime is 10077294893. The next prime is 10077294943. The reversal of 10077294895 is 59849277001.
10077294895 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10077294895 - 21 = 10077294893 is a prime.
It is a super-2 number, since 2×100772948952 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10077294893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1136842 + ... + 1145671.
It is an arithmetic number, because the mean of its divisors is an integer number (1513306782).
Almost surely, 210077294895 is an apocalyptic number.
10077294895 is a deficient number, since it is larger than the sum of its proper divisors (2029159361).
10077294895 is an equidigital number, since it uses as much as digits as its factorization.
10077294895 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2283401.
The product of its (nonzero) digits is 1270080, while the sum is 52.
The spelling of 10077294895 in words is "ten billion, seventy-seven million, two hundred ninety-four thousand, eight hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •