Base | Representation |
---|---|
bin | 10110111111010001011011… |
… | …001011111011001011110100 |
3 | 111020222112211110122221210101 |
4 | 112333101123023323023310 |
5 | 101223001130330004000 |
6 | 555011005013403444 |
7 | 30203412432152653 |
oct | 2677213313731364 |
9 | 436875743587711 |
10 | 101105060000500 |
11 | 2a240462626466 |
12 | b40aa08039584 |
13 | 445522132a04a |
14 | 1ad772231919a |
15 | ba4e945c9e6a |
hex | 5bf45b2fb2f4 |
101105060000500 has 48 divisors (see below), whose sum is σ = 221062396149504. Its totient is φ = 40396429658400.
The previous prime is 101105060000471. The next prime is 101105060000501. The reversal of 101105060000500 is 5000060501101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101105060000501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 113541912 + ... + 114428911.
It is an arithmetic number, because the mean of its divisors is an integer number (4605466586448).
Almost surely, 2101105060000500 is an apocalyptic number.
101105060000500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101105060000500 is an abundant number, since it is smaller than the sum of its proper divisors (119957336149004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101105060000500 is a wasteful number, since it uses less digits than its factorization.
101105060000500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227971729 (or 227971717 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
The spelling of 101105060000500 in words is "one hundred one trillion, one hundred five billion, sixty million, five hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •