Base | Representation |
---|---|
bin | 10111110111111101110011… |
… | …010111011001111011111100 |
3 | 111202202222221021222202111220 |
4 | 113313331303113121323330 |
5 | 102230314022224010300 |
6 | 1011152443254113340 |
7 | 31055033455233660 |
oct | 2767756327317374 |
9 | 452688837882456 |
10 | 105001001000700 |
11 | 30502746770342 |
12 | b939a9294b850 |
13 | 46787237079cc |
14 | 1bd010b4c68a0 |
15 | c214b4d1dda0 |
hex | 5f7f735d9efc |
105001001000700 has 72 divisors (see below), whose sum is σ = 347203309982592. Its totient is φ = 24000228799680.
The previous prime is 105001001000669. The next prime is 105001001000711. The reversal of 105001001000700 is 7000100100501.
It is a super-2 number, since 2×1050010010007002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 105001001000700.
It is a congruent number.
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, 25000236234 + ... + 25000240433.
Almost surely, 2105001001000700 is an apocalyptic number.
105001001000700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105001001000700 is an abundant number, since it is smaller than the sum of its proper divisors (242202308981892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105001001000700 is a wasteful number, since it uses less digits than its factorization.
105001001000700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50000476691 (or 50000476684 counting only the distinct ones).
The product of its (nonzero) digits is 35, while the sum is 15.
The spelling of 105001001000700 in words is "one hundred five trillion, one billion, one million, seven hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •