Base | Representation |
---|---|
bin | 11101100101110010100001… |
… | …100101110010000110101100 |
3 | 122001210021122200212122222221 |
4 | 131211302201211302012230 |
5 | 114024204132321331012 |
6 | 1140441331453245124 |
7 | 36261214655012626 |
oct | 3545624145620654 |
9 | 561707580778887 |
10 | 130140220105132 |
11 | 38515180556636 |
12 | 1271a0684937a4 |
13 | 57802299206b3 |
14 | 241cb6ab23c16 |
15 | 100a3a4796507 |
hex | 765ca19721ac |
130140220105132 has 12 divisors (see below), whose sum is σ = 227745467510400. Its totient is φ = 65070086530736.
The previous prime is 130140220105097. The next prime is 130140220105139. The reversal of 130140220105132 is 231501022041031.
It is a junction number, because it is equal to n+sod(n) for n = 130140220105097 and 130140220105106.
It is not an unprimeable number, because it can be changed into a prime (130140220105139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14146869 + ... + 21457267.
It is an arithmetic number, because the mean of its divisors is an integer number (18978788959200).
Almost surely, 2130140220105132 is an apocalyptic number.
It is an amenable number.
130140220105132 is a deficient number, since it is larger than the sum of its proper divisors (97605247405268).
130140220105132 is a wasteful number, since it uses less digits than its factorization.
130140220105132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11760920 (or 11760918 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 130140220105132 its reverse (231501022041031), we get a palindrome (361641242146163).
The spelling of 130140220105132 in words is "one hundred thirty trillion, one hundred forty billion, two hundred twenty million, one hundred five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •