Base | Representation |
---|---|
bin | 10110111110101000011100… |
… | …011011110100101011101000 |
3 | 111020211100020212020212202222 |
4 | 112332220130123310223220 |
5 | 101221241021211434400 |
6 | 554534450420013212 |
7 | 30200264134300466 |
oct | 2676503433645350 |
9 | 436740225225688 |
10 | 101061057530600 |
11 | 2a223832357562 |
12 | b402387831208 |
13 | 445102ac9cacb |
14 | 1ad554a353836 |
15 | ba3c6b531185 |
hex | 5bea1c6f4ae8 |
101061057530600 has 48 divisors (see below), whose sum is σ = 235437834660000. Its totient is φ = 40343412104640.
The previous prime is 101061057530597. The next prime is 101061057530603. The reversal of 101061057530600 is 6035750160101.
It is an interprime number because it is at equal distance from previous prime (101061057530597) and next prime (101061057530603).
It is not an unprimeable number, because it can be changed into a prime (101061057530603) 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, 506218124 + ... + 506417723.
It is an arithmetic number, because the mean of its divisors is an integer number (4904954888750).
Almost surely, 2101061057530600 is an apocalyptic number.
101061057530600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101061057530600 is an abundant number, since it is smaller than the sum of its proper divisors (134376777129400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101061057530600 is a wasteful number, since it uses less digits than its factorization.
101061057530600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1012636362 (or 1012636353 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 35.
The spelling of 101061057530600 in words is "one hundred one trillion, sixty-one billion, fifty-seven million, five hundred thirty thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •