Base | Representation |
---|---|
bin | 11101100101010110011111… |
… | …100111100000000100010000 |
3 | 122001200101222010102012020010 |
4 | 131211112133213200010100 |
5 | 114023211012242330112 |
6 | 1140415433123314520 |
7 | 36256101056211630 |
oct | 3545263747400420 |
9 | 561611863365203 |
10 | 130110122230032 |
11 | 3850343604259a |
12 | 1271426881ba40 |
13 | 577a4411aa049 |
14 | 241b5136bc6c0 |
15 | 10096e228763c |
hex | 76559f9e0110 |
130110122230032 has 80 divisors (see below), whose sum is σ = 385295174546432. Its totient is φ = 37062011479680.
The previous prime is 130110122229977. The next prime is 130110122230061. The reversal of 130110122230032 is 230032221011031.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 130110122229990 and 130110122230008.
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, 584832148 + ... + 585054579.
Almost surely, 2130110122230032 is an apocalyptic number.
130110122230032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130110122230032 is an abundant number, since it is smaller than the sum of its proper divisors (255185052316400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130110122230032 is a wasteful number, since it uses less digits than its factorization.
130110122230032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1169887076 (or 1169887070 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 130110122230032 its reverse (230032221011031), we get a palindrome (360142343241063).
The spelling of 130110122230032 in words is "one hundred thirty trillion, one hundred ten billion, one hundred twenty-two million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •