Base | Representation |
---|---|
bin | 101111010010110100… |
… | …1010111000111110100 |
3 | 100201011010022210022002 |
4 | 1132211221113013310 |
5 | 3131000203043220 |
6 | 114354010354432 |
7 | 10223556033002 |
oct | 1364551270764 |
9 | 321133283262 |
10 | 101563331060 |
11 | 3a088941944 |
12 | 1782542ba18 |
13 | 9767676bc9 |
14 | 4cb692ba72 |
15 | 29965e3c75 |
hex | 17a5a571f4 |
101563331060 has 24 divisors (see below), whose sum is σ = 213315294696. Its totient is φ = 40619180160.
The previous prime is 101563331059. The next prime is 101563331087. The reversal of 101563331060 is 60133365101.
It can be written as a sum of positive squares in 4 ways, for example, as 19495978384 + 82067352676 = 139628^2 + 286474^2 .
It is a super-2 number, since 2×1015633310602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 247967 + ... + 514406.
It is an arithmetic number, because the mean of its divisors is an integer number (8888137279).
Almost surely, 2101563331060 is an apocalyptic number.
101563331060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101563331060 is an abundant number, since it is smaller than the sum of its proper divisors (111751963636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101563331060 is a wasteful number, since it uses less digits than its factorization.
101563331060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769043 (or 769041 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 29.
Adding to 101563331060 its reverse (60133365101), we get a palindrome (161696696161).
The spelling of 101563331060 in words is "one hundred one billion, five hundred sixty-three million, three hundred thirty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •