Base | Representation |
---|---|
bin | 11101101101001001110111… |
… | …000101110100000100111110 |
3 | 122010120122222012100210212200 |
4 | 131231021313011310010332 |
5 | 114111002122141104322 |
6 | 1141510030541212330 |
7 | 36342612301355622 |
oct | 3555116705640476 |
9 | 563518865323780 |
10 | 130646313222462 |
11 | 3869a876965294 |
12 | 127a0169b610a6 |
13 | 57b8b8220b02b |
14 | 243945b275182 |
15 | 10186252a78ac |
hex | 76d27717413e |
130646313222462 has 24 divisors (see below), whose sum is σ = 283083903083280. Its totient is φ = 43546172443200.
The previous prime is 130646313222461. The next prime is 130646313222547. The reversal of 130646313222462 is 264222313646031.
130646313222462 is a `hidden beast` number, since 1 + 3 + 0 + 6 + 4 + 631 + 3 + 2 + 2 + 2 + 4 + 6 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130646313222461) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 216242539 + ... + 216845862.
It is an arithmetic number, because the mean of its divisors is an integer number (11795162628470).
Almost surely, 2130646313222462 is an apocalyptic number.
130646313222462 is an abundant number, since it is smaller than the sum of its proper divisors (152437589860818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130646313222462 is a wasteful number, since it uses less digits than its factorization.
130646313222462 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 433105168 (or 433105165 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 45.
Adding to 130646313222462 its reverse (264222313646031), we get a palindrome (394868626868493).
The spelling of 130646313222462 in words is "one hundred thirty trillion, six hundred forty-six billion, three hundred thirteen million, two hundred twenty-two thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •