Base | Representation |
---|---|
bin | 10010101110101010… |
… | …01100111010110101 |
3 | 221221202110112021112 |
4 | 21113111030322311 |
5 | 131043102012300 |
6 | 4341431524405 |
7 | 504114012311 |
oct | 112725147265 |
9 | 27852415245 |
10 | 10055110325 |
11 | 429a936237 |
12 | 1b47529705 |
13 | c43244930 |
14 | 6b55cab41 |
15 | 3dcb46e35 |
hex | 25754ceb5 |
10055110325 has 48 divisors (see below), whose sum is σ = 13822448640. Its totient is φ = 7208974080.
The previous prime is 10055110321. The next prime is 10055110333. The reversal of 10055110325 is 52301155001.
It is a happy number.
It is not a de Polignac number, because 10055110325 - 22 = 10055110321 is a prime.
It is a super-2 number, since 2×100551103252 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10055110325.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10055110321) 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 47 ways as a sum of consecutive naturals, for example, 2415596 + ... + 2419754.
It is an arithmetic number, because the mean of its divisors is an integer number (287967680).
Almost surely, 210055110325 is an apocalyptic number.
It is an amenable number.
10055110325 is a deficient number, since it is larger than the sum of its proper divisors (3767338315).
10055110325 is a wasteful number, since it uses less digits than its factorization.
10055110325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4398 (or 4393 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
Adding to 10055110325 its reverse (52301155001), we get a palindrome (62356265326).
The spelling of 10055110325 in words is "ten billion, fifty-five million, one hundred ten thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •