Base | Representation |
---|---|
bin | 10111000000101010000110… |
… | …010101001010010001000000 |
3 | 111021022122121000221200201102 |
4 | 113000222012111022101000 |
5 | 101231031124404403433 |
6 | 555122432541153532 |
7 | 30213323052302360 |
oct | 2700520625122100 |
9 | 437278530850642 |
10 | 101200273122368 |
11 | 2a27788198a132 |
12 | b42535a85b8a8 |
13 | 44611b61aaa04 |
14 | 1adc1957149a0 |
15 | ba76b845a4e8 |
hex | 5c0a8654a440 |
101200273122368 has 224 divisors, whose sum is σ = 241093550100480. Its totient is φ = 41240249487360.
The previous prime is 101200273122329. The next prime is 101200273122373. The reversal of 101200273122368 is 863221372002101.
It is a tau number, because it is divible by the number of its divisors (224).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 365550143 + ... + 365826881.
It is an arithmetic number, because the mean of its divisors is an integer number (1076310491520).
Almost surely, 2101200273122368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101200273122368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120546775050240).
101200273122368 is an abundant number, since it is smaller than the sum of its proper divisors (139893276978112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200273122368 is a wasteful number, since it uses less digits than its factorization.
101200273122368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277305 (or 277295 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 101200273122368 in words is "one hundred one trillion, two hundred billion, two hundred seventy-three million, one hundred twenty-two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •