Base | Representation |
---|---|
bin | 10111000000111101101110… |
… | …000001000000010100010000 |
3 | 111021101122222020001002011112 |
4 | 113000331232001000110100 |
5 | 101231402301021201112 |
6 | 555140235222032452 |
7 | 30215000111062046 |
oct | 2700755601002420 |
9 | 437348866032145 |
10 | 101221340022032 |
11 | 2a28580267570a |
12 | b429459b78728 |
13 | 4463192917109 |
14 | 1add1d35a0396 |
15 | ba7eecbbea22 |
hex | 5c0f6e040510 |
101221340022032 has 40 divisors (see below), whose sum is σ = 206439067411200. Its totient is φ = 47946762836352.
The previous prime is 101221340021993. The next prime is 101221340022107. The reversal of 101221340022032 is 230220043122101.
It is a junction number, because it is equal to n+sod(n) for n = 101221340021989 and 101221340022007.
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 7 ways as a sum of consecutive naturals, for example, 105544769 + ... + 106499487.
It is an arithmetic number, because the mean of its divisors is an integer number (5160976685280).
Almost surely, 2101221340022032 is an apocalyptic number.
It is an amenable number.
101221340022032 is an abundant number, since it is smaller than the sum of its proper divisors (105217727389168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221340022032 is a wasteful number, since it uses less digits than its factorization.
101221340022032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1303503 (or 1303497 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 101221340022032 its reverse (230220043122101), we get a palindrome (331441383144133).
The spelling of 101221340022032 in words is "one hundred one trillion, two hundred twenty-one billion, three hundred forty million, twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •