Base | Representation |
---|---|
bin | 10110111111101001110010… |
… | …100111111011110110101100 |
3 | 111021002001100211000012120110 |
4 | 112333221302213323312230 |
5 | 101223413221043214040 |
6 | 555031013102020020 |
7 | 30205326661163361 |
oct | 2677516247736654 |
9 | 437061324005513 |
10 | 101131223023020 |
11 | 2a250568a02523 |
12 | b413aa9b77610 |
13 | 44578307abb68 |
14 | 1ad8ac4d28468 |
15 | ba59c6431980 |
hex | 5bfa729fbdac |
101131223023020 has 96 divisors (see below), whose sum is σ = 298096816711680. Its totient is φ = 25546725388800.
The previous prime is 101131223022931. The next prime is 101131223023067. The reversal of 101131223023020 is 20320322131101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9328144 + ... + 17008136.
It is an arithmetic number, because the mean of its divisors is an integer number (3105175174080).
Almost surely, 2101131223023020 is an apocalyptic number.
101131223023020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101131223023020 is an abundant number, since it is smaller than the sum of its proper divisors (196965593688660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101131223023020 is a wasteful number, since it uses less digits than its factorization.
101131223023020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7691575 (or 7691573 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101131223023020 its reverse (20320322131101), we get a palindrome (121451545154121).
The spelling of 101131223023020 in words is "one hundred one trillion, one hundred thirty-one billion, two hundred twenty-three million, twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •