Base | Representation |
---|---|
bin | 11101100101110111111011… |
… | …101001101001110110110101 |
3 | 122001210211122022202112210000 |
4 | 131211313323221221312311 |
5 | 114024303030131133121 |
6 | 1140444131534421513 |
7 | 36261511564426665 |
oct | 3545677351516665 |
9 | 561724568675700 |
10 | 130146026036661 |
11 | 3851768a885958 |
12 | 1271b208961899 |
13 | 578094372ac3b |
14 | 241d15bc561a5 |
15 | 100a5e4347526 |
hex | 765dfba69db5 |
130146026036661 has 160 divisors (see below), whose sum is σ = 203795531089920. Its totient is φ = 82685967509376.
The previous prime is 130146026036651. The next prime is 130146026036669. The reversal of 130146026036661 is 166630620641031.
It is not a de Polignac number, because 130146026036661 - 29 = 130146026036149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130146026036669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 99881830536 + ... + 99881831838.
It is an arithmetic number, because the mean of its divisors is an integer number (1273722069312).
Almost surely, 2130146026036661 is an apocalyptic number.
It is an amenable number.
130146026036661 is a deficient number, since it is larger than the sum of its proper divisors (73649505053259).
130146026036661 is a wasteful number, since it uses less digits than its factorization.
130146026036661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3037 (or 3028 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 45.
Adding to 130146026036661 its reverse (166630620641031), we get a palindrome (296776646677692).
The spelling of 130146026036661 in words is "one hundred thirty trillion, one hundred forty-six billion, twenty-six million, thirty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •