Base | Representation |
---|---|
bin | 1001001001001000010001… |
… | …1010100110111000011011 |
3 | 1022121000010011211100000000 |
4 | 2102102010122212320123 |
5 | 2304144401412241110 |
6 | 33214010212144043 |
7 | 2055156650003100 |
oct | 222220432467033 |
9 | 38530104740000 |
10 | 10052445040155 |
11 | 3226244181a11 |
12 | 1164293608023 |
13 | 57bc3162386b |
14 | 26a780484aa7 |
15 | 1267492a91c0 |
hex | 924846a6e1b |
10052445040155 has 648 divisors, whose sum is σ = 22788626562000. Its totient is φ = 4232314872576.
The previous prime is 10052445040139. The next prime is 10052445040199. The reversal of 10052445040155 is 55104054425001.
10052445040155 is a `hidden beast` number, since 1 + 0 + 0 + 5 + 244 + 5 + 0 + 401 + 5 + 5 = 666.
It is not a de Polignac number, because 10052445040155 - 24 = 10052445040139 is a prime.
It is an unprimeable number.
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 647 ways as a sum of consecutive naturals, for example, 67466074021 + ... + 67466074169.
Almost surely, 210052445040155 is an apocalyptic number.
10052445040155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10052445040155 is an abundant number, since it is smaller than the sum of its proper divisors (12736181521845).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10052445040155 is an frugal number, since it uses more digits than its factorization.
10052445040155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305 (or 230 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 36.
Adding to 10052445040155 its reverse (55104054425001), we get a palindrome (65156499465156).
The spelling of 10052445040155 in words is "ten trillion, fifty-two billion, four hundred forty-five million, forty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •