Base | Representation |
---|---|
bin | 1001001000101110010000… |
… | …0011010001010001110100 |
3 | 1022120100002100111020020210 |
4 | 2102023210003101101310 |
5 | 2304041100124204000 |
6 | 33210453114025420 |
7 | 2054521565515602 |
oct | 222134403212164 |
9 | 38510070436223 |
10 | 10045459600500 |
11 | 322328a072795 |
12 | 1162a64118270 |
13 | 57b38a34810c |
14 | 26a2ba838872 |
15 | 12648adb9350 |
hex | 922e40d1474 |
10045459600500 has 48 divisors (see below), whose sum is σ = 29252378361024. Its totient is φ = 2678789226400.
The previous prime is 10045459600439. The next prime is 10045459600543. The reversal of 10045459600500 is 500695454001.
It is a super-2 number, since 2×100454596005002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3348485034 + ... + 3348488033.
It is an arithmetic number, because the mean of its divisors is an integer number (609424549188).
Almost surely, 210045459600500 is an apocalyptic number.
10045459600500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10045459600500 is an abundant number, since it is smaller than the sum of its proper divisors (19206918760524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10045459600500 is a wasteful number, since it uses less digits than its factorization.
10045459600500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6696973089 (or 6696973077 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 10045459600500 in words is "ten trillion, forty-five billion, four hundred fifty-nine million, six hundred thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •