Base | Representation |
---|---|
bin | 101111001000101000… |
… | …1000111100001101100 |
3 | 100200021021222111010212 |
4 | 1132101101013201230 |
5 | 3124300141301104 |
6 | 114300034321552 |
7 | 10212234654002 |
oct | 1362121074154 |
9 | 320237874125 |
10 | 101221431404 |
11 | 39a2294a645 |
12 | 1774aa292b8 |
13 | 9711898a12 |
14 | 4c8336ca72 |
15 | 29765aa36e |
hex | 179144786c |
101221431404 has 12 divisors (see below), whose sum is σ = 177179699928. Its totient is φ = 50598660000.
The previous prime is 101221431361. The next prime is 101221431457. The reversal of 101221431404 is 404134122101.
101221431404 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1012214314042 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101221431404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2995022 + ... + 3028629.
It is an arithmetic number, because the mean of its divisors is an integer number (14764974994).
Almost surely, 2101221431404 is an apocalyptic number.
It is an amenable number.
101221431404 is a deficient number, since it is larger than the sum of its proper divisors (75958268524).
101221431404 is a wasteful number, since it uses less digits than its factorization.
101221431404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6027856 (or 6027854 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 101221431404 its reverse (404134122101), we get a palindrome (505355553505).
The spelling of 101221431404 in words is "one hundred one billion, two hundred twenty-one million, four hundred thirty-one thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •