Base | Representation |
---|---|
bin | 11101101011101101000010… |
… | …011111111111100100100111 |
3 | 122010020010201021010002102000 |
4 | 131223231002133333210213 |
5 | 114102334013020120111 |
6 | 1141352145044420343 |
7 | 36332453413421601 |
oct | 3553550237774447 |
9 | 563203637102360 |
10 | 130546646645031 |
11 | 38661581761531 |
12 | 127849939a76b3 |
13 | 57ac65a7cc166 |
14 | 24346c4608171 |
15 | 1015c4047ec56 |
hex | 76bb427ff927 |
130546646645031 has 32 divisors (see below), whose sum is σ = 198634982865600. Its totient is φ = 84676582327680.
The previous prime is 130546646644969. The next prime is 130546646645099.
It is a happy number.
130546646645031 is a `hidden beast` number, since 1 + 3 + 0 + 5 + 46 + 64 + 66 + 450 + 31 = 666.
130546646645031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130546646645031 - 27 = 130546646644903 is a prime.
It is a super-2 number, since 2×1305466466450312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130546646643031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35009685 + ... + 38558673.
It is an arithmetic number, because the mean of its divisors is an integer number (6207343214550).
Almost surely, 2130546646645031 is an apocalyptic number.
130546646645031 is a deficient number, since it is larger than the sum of its proper divisors (68088336220569).
130546646645031 is a wasteful number, since it uses less digits than its factorization.
130546646645031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3585856 (or 3585850 counting only the distinct ones).
The product of its (nonzero) digits is 18662400, while the sum is 54.
The spelling of 130546646645031 in words is "one hundred thirty trillion, five hundred forty-six billion, six hundred forty-six million, six hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •