Base | Representation |
---|---|
bin | 11101100011111010001110… |
… | …100110010011001001101001 |
3 | 122001022221020210011011001200 |
4 | 131203322032212103021221 |
5 | 114020100113412021010 |
6 | 1140302130350234413 |
7 | 36245663036054055 |
oct | 3543721646231151 |
9 | 561287223134050 |
10 | 130011052454505 |
11 | 38475417802952 |
12 | 126b901a4b5a09 |
13 | 5770cb33171b1 |
14 | 24167d6004c65 |
15 | 1006d44a49cc0 |
hex | 763e8e993269 |
130011052454505 has 48 divisors (see below), whose sum is σ = 230375322927360. Its totient is φ = 67796665542144.
The previous prime is 130011052454483. The next prime is 130011052454513. The reversal of 130011052454505 is 505454250110031.
130011052454505 is a `hidden beast` number, since 1 + 3 + 0 + 0 + 1 + 105 + 2 + 4 + 545 + 0 + 5 = 666.
It is not a de Polignac number, because 130011052454505 - 210 = 130011052453481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130011052454505.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28327287 + ... + 32595356.
It is an arithmetic number, because the mean of its divisors is an integer number (4799485894320).
Almost surely, 2130011052454505 is an apocalyptic number.
130011052454505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130011052454505 is a deficient number, since it is larger than the sum of its proper divisors (100364270472855).
130011052454505 is a wasteful number, since it uses less digits than its factorization.
130011052454505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60923710 (or 60923707 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 130011052454505 in words is "one hundred thirty trillion, eleven billion, fifty-two million, four hundred fifty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.262 sec. • engine limits •