Base | Representation |
---|---|
bin | 11101100101111101101001… |
… | …011011010010000010100010 |
3 | 122001211102111000000212122220 |
4 | 131211331221123102002202 |
5 | 114024403112124331041 |
6 | 1140451024513211510 |
7 | 36262116631444434 |
oct | 3545755133220242 |
9 | 561742430025586 |
10 | 130152162730146 |
11 | 3851a24988a567 |
12 | 1272043bb60b96 |
13 | 57813b0c1700b |
14 | 241d580c88654 |
15 | 100a852e81d66 |
hex | 765f696d20a2 |
130152162730146 has 32 divisors (see below), whose sum is σ = 261850768478208. Its totient is φ = 43126512088320.
The previous prime is 130152162730141. The next prime is 130152162730259. The reversal of 130152162730146 is 641037261251031.
It is a happy number.
130152162730146 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130152162730098 and 130152162730107.
It is not an unprimeable number, because it can be changed into a prime (130152162730141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22167330 + ... + 27417053.
It is an arithmetic number, because the mean of its divisors is an integer number (8182836514944).
Almost surely, 2130152162730146 is an apocalyptic number.
130152162730146 is an abundant number, since it is smaller than the sum of its proper divisors (131698605748062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130152162730146 is a wasteful number, since it uses less digits than its factorization.
130152162730146 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49586986.
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 130152162730146 in words is "one hundred thirty trillion, one hundred fifty-two billion, one hundred sixty-two million, seven hundred thirty thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •