Base | Representation |
---|---|
bin | 10110111110001101011001… |
… | …000000100001101011011100 |
3 | 111020201120021102100100020001 |
4 | 112332031121000201223130 |
5 | 101220302023301421410 |
6 | 554513244133304044 |
7 | 30165215240053612 |
oct | 2676153100415334 |
9 | 436646242310201 |
10 | 101032009013980 |
11 | 2a21248620a030 |
12 | b3b881b495024 |
13 | 444b37ba88a35 |
14 | 1ad3d924276b2 |
15 | ba311b20333a |
hex | 5be359021adc |
101032009013980 has 48 divisors (see below), whose sum is σ = 232309226096640. Its totient is φ = 36603344404800.
The previous prime is 101032009013933. The next prime is 101032009013981. The reversal of 101032009013980 is 89310900230101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101032009013981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 847240020 + ... + 847359259.
It is an arithmetic number, because the mean of its divisors is an integer number (4839775543680).
Almost surely, 2101032009013980 is an apocalyptic number.
101032009013980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101032009013980 is an abundant number, since it is smaller than the sum of its proper divisors (131277217082660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101032009013980 is a wasteful number, since it uses less digits than its factorization.
101032009013980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1694599570 (or 1694599568 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 101032009013980 in words is "one hundred one trillion, thirty-two billion, nine million, thirteen thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •