Base | Representation |
---|---|
bin | 110000111010100111… |
… | …1101110001010001000 |
3 | 101001010212002110010211 |
4 | 1201311033232022020 |
5 | 3210113321124400 |
6 | 120131350050504 |
7 | 10406100365455 |
oct | 1416517561210 |
9 | 331125073124 |
10 | 105046270600 |
11 | 40605976977 |
12 | 18437949a34 |
13 | 9ba111c08b |
14 | 512732882c |
15 | 2aec280dba |
hex | 18753ee288 |
105046270600 has 96 divisors (see below), whose sum is σ = 245937384000. Its totient is φ = 41726048000.
The previous prime is 105046270591. The next prime is 105046270633. The reversal of 105046270600 is 6072640501.
It is a happy number.
It is a super-2 number, since 2×1050462706002 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23598375 + ... + 23602825.
It is an arithmetic number, because the mean of its divisors is an integer number (2561847750).
Almost surely, 2105046270600 is an apocalyptic number.
105046270600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105046270600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122968692000).
105046270600 is an abundant number, since it is smaller than the sum of its proper divisors (140891113400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105046270600 is a wasteful number, since it uses less digits than its factorization.
105046270600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5263 (or 5254 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
The spelling of 105046270600 in words is "one hundred five billion, forty-six million, two hundred seventy thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •