Base | Representation |
---|---|
bin | 10010101110101110… |
… | …00100110110010001 |
3 | 221221210101111010011 |
4 | 21113113010312101 |
5 | 131043213222203 |
6 | 4341450234521 |
7 | 504121126414 |
oct | 112727046621 |
9 | 27853344104 |
10 | 10055601553 |
11 | 42a0141308 |
12 | 1b47725a41 |
13 | c433873ba |
14 | 6b56b7b7b |
15 | 3dcbe276d |
hex | 2575c4d91 |
10055601553 has 8 divisors (see below), whose sum is σ = 10599417920. Its totient is φ = 9513242640.
The previous prime is 10055601551. The next prime is 10055601581. The reversal of 10055601553 is 35510655001.
10055601553 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 10055601553 - 21 = 10055601551 is a prime.
It is a super-2 number, since 2×100556015532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10055601551) 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, 350178 + ... + 377803.
It is an arithmetic number, because the mean of its divisors is an integer number (1324927240).
Almost surely, 210055601553 is an apocalyptic number.
It is an amenable number.
10055601553 is a deficient number, since it is larger than the sum of its proper divisors (543816367).
10055601553 is an equidigital number, since it uses as much as digits as its factorization.
10055601553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728727.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 10055601553 in words is "ten billion, fifty-five million, six hundred one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •