Base | Representation |
---|---|
bin | 110000111111100111… |
… | …1110011101101011100 |
3 | 101001120112211022110202 |
4 | 1201333033303231130 |
5 | 3210434300044000 |
6 | 120200142323032 |
7 | 10413205541435 |
oct | 1417717635534 |
9 | 331515738422 |
10 | 105214065500 |
11 | 40691662745 |
12 | 18483b89478 |
13 | 9bc9b0b7bb |
14 | 514172648c |
15 | 2b0bd77dd5 |
hex | 187f3f3b5c |
105214065500 has 48 divisors (see below), whose sum is σ = 230011524288. Its totient is φ = 42044600000.
The previous prime is 105214065499. The next prime is 105214065557. The reversal of 105214065500 is 5560412501.
It is a happy number.
It is a super-2 number, since 2×1052140655002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 413450 + ... + 617550.
It is an arithmetic number, because the mean of its divisors is an integer number (4791906756).
Almost surely, 2105214065500 is an apocalyptic number.
105214065500 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 105214065500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115005762144).
105214065500 is an abundant number, since it is smaller than the sum of its proper divisors (124797458788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105214065500 is a wasteful number, since it uses less digits than its factorization.
105214065500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205151 (or 205139 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 29.
The spelling of 105214065500 in words is "one hundred five billion, two hundred fourteen million, sixty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •