Base | Representation |
---|---|
bin | 10100010101000111… |
… | …01110011011010001 |
3 | 1001011122122212120001 |
4 | 22022203232123101 |
5 | 134323111234401 |
6 | 5003012450001 |
7 | 534321122545 |
oct | 121243563321 |
9 | 31148585501 |
10 | 10914555601 |
11 | 46a0a89194 |
12 | 2147319901 |
13 | 104c30c131 |
14 | 7577cba25 |
15 | 43d312601 |
hex | 28a8ee6d1 |
10914555601 has 8 divisors (see below), whose sum is σ = 11104967808. Its totient is φ = 10724514000.
The previous prime is 10914555569. The next prime is 10914555629. The reversal of 10914555601 is 10655541901.
10914555601 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 10914555601 - 25 = 10914555569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10914558601) 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, 32905 + ... + 151366.
It is an arithmetic number, because the mean of its divisors is an integer number (1388120976).
Almost surely, 210914555601 is an apocalyptic number.
It is an amenable number.
10914555601 is a deficient number, since it is larger than the sum of its proper divisors (190412207).
10914555601 is an equidigital number, since it uses as much as digits as its factorization.
10914555601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185303.
The product of its (nonzero) digits is 27000, while the sum is 37.
It can be divided in two parts, 109 and 14555601, that added together give a triangular number (14555710 = T5395).
The spelling of 10914555601 in words is "ten billion, nine hundred fourteen million, five hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •