Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …110001110010110010100000 |
3 | 111020121111200102102212021220 |
4 | 112331233211301302302200 |
5 | 101214241010304012432 |
6 | 554450433045015040 |
7 | 30163003266330165 |
oct | 2675574561626240 |
9 | 436544612385256 |
10 | 101000011000992 |
11 | 2a1aa9561662a4 |
12 | b3b258b3b4480 |
13 | 444834c793b3c |
14 | 1ad25d88c006c |
15 | ba2396eaa72c |
hex | 5bdbe5c72ca0 |
101000011000992 has 48 divisors (see below), whose sum is σ = 265150012710240. Its totient is φ = 33663497783552.
The previous prime is 101000011000991. The next prime is 101000011001027. The reversal of 101000011000992 is 299000110000101.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (101000011000991) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48546942 + ... + 50584637.
It is an arithmetic number, because the mean of its divisors is an integer number (5523958598130).
Almost surely, 2101000011000992 is an apocalyptic number.
101000011000992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101000011000992 is an abundant number, since it is smaller than the sum of its proper divisors (164150001709248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000011000992 is a wasteful number, since it uses less digits than its factorization.
101000011000992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99142205 (or 99142197 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 24.
The spelling of 101000011000992 in words is "one hundred one trillion, eleven million, nine hundred ninety-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •