Base | Representation |
---|---|
bin | 1001001001010011101010… |
… | …0000011001010000000100 |
3 | 1022121022000002021220110211 |
4 | 2102110322200121100010 |
5 | 2304222131000314000 |
6 | 33215233302525204 |
7 | 2055325443554140 |
oct | 222247240312004 |
9 | 38538002256424 |
10 | 10055500010500 |
11 | 322757167839a |
12 | 11649a6736804 |
13 | 57c2ca513919 |
14 | 26a9900ba220 |
15 | 1268775aa7ba |
hex | 9253a819404 |
10055500010500 has 48 divisors (see below), whose sum is σ = 25098528034944. Its totient is φ = 3447600002400.
The previous prime is 10055500010473. The next prime is 10055500010509. The reversal of 10055500010500 is 501000555001.
It is a super-2 number, since 2×100555000105002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10055500010509) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1436496502 + ... + 1436503501.
It is an arithmetic number, because the mean of its divisors is an integer number (522886000728).
Almost surely, 210055500010500 is an apocalyptic number.
10055500010500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10055500010500 is an abundant number, since it is smaller than the sum of its proper divisors (15043028024444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10055500010500 is a wasteful number, since it uses less digits than its factorization.
10055500010500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2873000029 (or 2873000017 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 22.
Adding to 10055500010500 its reverse (501000555001), we get a palindrome (10556500565501).
The spelling of 10055500010500 in words is "ten trillion, fifty-five billion, five hundred million, ten thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •