Base | Representation |
---|---|
bin | 10010101110101110… |
… | …10000111110011111 |
3 | 221221210111000021002 |
4 | 21113113100332133 |
5 | 131043221314411 |
6 | 4341451300515 |
7 | 504121424303 |
oct | 112727207637 |
9 | 27853430232 |
10 | 10055651231 |
11 | 42a017566a |
12 | 1b4774a73b |
13 | c433a3bb2 |
14 | 6b56cbd03 |
15 | 3dcc0233b |
hex | 2575d0f9f |
10055651231 has 8 divisors (see below), whose sum is σ = 10211547120. Its totient is φ = 9900245952.
The previous prime is 10055651213. The next prime is 10055651251. The reversal of 10055651231 is 13215655001.
10055651231 is digitally balanced in base 3, 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 10055651231 - 210 = 10055650207 is a prime.
It is a super-2 number, since 2×100556512312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10055651194 and 10055651203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10055651251) 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, 81236 + ... + 163433.
It is an arithmetic number, because the mean of its divisors is an integer number (1276443390).
Almost surely, 210055651231 is an apocalyptic number.
10055651231 is a deficient number, since it is larger than the sum of its proper divisors (155895889).
10055651231 is an equidigital number, since it uses as much as digits as its factorization.
10055651231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245305.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 10055651231 in words is "ten billion, fifty-five million, six hundred fifty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •