Base | Representation |
---|---|
bin | 10111000010110110111100… |
… | …110100101110101101011010 |
3 | 111021212002222002010020112202 |
4 | 113002312330310232231122 |
5 | 101241020343333120010 |
6 | 555320124054410202 |
7 | 30230255634040010 |
oct | 2702667464565532 |
9 | 437762862106482 |
10 | 101351511223130 |
11 | 2a325a30947753 |
12 | b44a728060962 |
13 | 447253910186c |
14 | 1b056216b28b0 |
15 | bab5baa9e6a5 |
hex | 5c2dbcd2eb5a |
101351511223130 has 32 divisors (see below), whose sum is σ = 213343247551104. Its totient is φ = 33940971199296.
The previous prime is 101351511223033. The next prime is 101351511223147. The reversal of 101351511223130 is 31322115153101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101351511223093 and 101351511223102.
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, 16835796197 + ... + 16835802216.
It is an arithmetic number, because the mean of its divisors is an integer number (6666976485972).
Almost surely, 2101351511223130 is an apocalyptic number.
101351511223130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101351511223130 is an abundant number, since it is smaller than the sum of its proper divisors (111991736327974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101351511223130 is a wasteful number, since it uses less digits than its factorization.
101351511223130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33671598470.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 101351511223130 its reverse (31322115153101), we get a palindrome (132673626376231).
The spelling of 101351511223130 in words is "one hundred one trillion, three hundred fifty-one billion, five hundred eleven million, two hundred twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •