Base | Representation |
---|---|
bin | 10111000101010101110001… |
… | …110110111110101011000000 |
3 | 111022110102011101002011212012 |
4 | 113011111301312332223000 |
5 | 101301314130331312230 |
6 | 555530330435552052 |
7 | 30245504044403255 |
oct | 2705256166765300 |
9 | 438412141064765 |
10 | 101522052213440 |
11 | 2a391295888951 |
12 | b4777a1a5b628 |
13 | 4485647163251 |
14 | 1b0d99d13142c |
15 | bb0c4cb5d395 |
hex | 5c5571dbeac0 |
101522052213440 has 112 divisors (see below), whose sum is σ = 257502695429952. Its totient is φ = 37991203700736.
The previous prime is 101522052213431. The next prime is 101522052213467. The reversal of 101522052213440 is 44312250225101.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 101522052213397 and 101522052213406.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54966197 + ... + 56783156.
It is an arithmetic number, because the mean of its divisors is an integer number (2299131209196).
Almost surely, 2101522052213440 is an apocalyptic number.
101522052213440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101522052213440 is an abundant number, since it is smaller than the sum of its proper divisors (155980643216512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101522052213440 is a wasteful number, since it uses less digits than its factorization.
101522052213440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111749554 (or 111749544 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
The spelling of 101522052213440 in words is "one hundred one trillion, five hundred twenty-two billion, fifty-two million, two hundred thirteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •