Base | Representation |
---|---|
bin | 10111111000101111010011… |
… | …100010110010100001110100 |
3 | 111202222002010122010022200022 |
4 | 113320233103202302201310 |
5 | 102232201401434032200 |
6 | 1011233113455504312 |
7 | 31061624606100026 |
oct | 2770572342624164 |
9 | 452862118108608 |
10 | 105054154205300 |
11 | 30523242324703 |
12 | b948247828098 |
13 | 4680744810671 |
14 | 1bd2910900016 |
15 | c22a7641b885 |
hex | 5f8bd38b2874 |
105054154205300 has 36 divisors (see below), whose sum is σ = 227997964696320. Its totient is φ = 42016048765920.
The previous prime is 105054154205279. The next prime is 105054154205303. The reversal of 105054154205300 is 3502451450501.
It is a super-2 number, since 2×1050541542053002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105054154205303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 69409010 + ... + 70906409.
It is an arithmetic number, because the mean of its divisors is an integer number (6333276797120).
Almost surely, 2105054154205300 is an apocalyptic number.
105054154205300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105054154205300 is an abundant number, since it is smaller than the sum of its proper divisors (122943810491020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105054154205300 is a wasteful number, since it uses less digits than its factorization.
105054154205300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140322920 (or 140322913 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 105054154205300 in words is "one hundred five trillion, fifty-four billion, one hundred fifty-four million, two hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •