Base | Representation |
---|---|
bin | 101111001100110010… |
… | …0001111101000010100 |
3 | 100200121222222012001212 |
4 | 1132121210033220110 |
5 | 3130041312204220 |
6 | 114321530440552 |
7 | 10215545264126 |
oct | 1363144175024 |
9 | 320558865055 |
10 | 101360663060 |
11 | 39a944a7428 |
12 | 17789593158 |
13 | 9734697407 |
14 | 4c97a53216 |
15 | 298390e0c5 |
hex | 179990fa14 |
101360663060 has 216 divisors, whose sum is σ = 236851682760. Its totient is φ = 36401757696.
The previous prime is 101360663029. The next prime is 101360663069. The reversal of 101360663060 is 60366063101.
It can be written as a sum of positive squares in 4 ways, for example, as 37176467344 + 64184195716 = 192812^2 + 253346^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101360663069) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 929914286 + ... + 929914394.
Almost surely, 2101360663060 is an apocalyptic number.
101360663060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101360663060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118425841380).
101360663060 is an abundant number, since it is smaller than the sum of its proper divisors (135491019700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101360663060 is a wasteful number, since it uses less digits than its factorization.
101360663060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 311 (or 231 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 101360663060 in words is "one hundred one billion, three hundred sixty million, six hundred sixty-three thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •