Base | Representation |
---|---|
bin | 111100100110101000… |
… | …1110110101101001000 |
3 | 110102221001210200212120 |
4 | 1321031101312231020 |
5 | 4113014224420112 |
6 | 135442114411240 |
7 | 12255061610616 |
oct | 1711521665510 |
9 | 412831720776 |
10 | 130145545032 |
11 | 50215849288 |
12 | 21281590b20 |
13 | c3710a3a59 |
14 | 64289546b6 |
15 | 35baa12e8c |
hex | 1e4d476b48 |
130145545032 has 64 divisors (see below), whose sum is σ = 362634667200. Its totient is φ = 38681026560.
The previous prime is 130145544959. The next prime is 130145545073. The reversal of 130145545032 is 230545541031.
130145545032 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 130145544984 and 130145545002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8386569 + ... + 8402072.
It is an arithmetic number, because the mean of its divisors is an integer number (5666166675).
Almost surely, 2130145545032 is an apocalyptic number.
130145545032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130145545032 is an abundant number, since it is smaller than the sum of its proper divisors (232489122168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130145545032 is a wasteful number, since it uses less digits than its factorization.
130145545032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16788686 (or 16788682 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
The spelling of 130145545032 in words is "one hundred thirty billion, one hundred forty-five million, five hundred forty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •