Base | Representation |
---|---|
bin | 111100100011100110… |
… | …1001001000010111000 |
3 | 110102122222001200212101 |
4 | 1321013031021002320 |
5 | 4112312133134021 |
6 | 135424034353144 |
7 | 12252413516365 |
oct | 1710715110270 |
9 | 412588050771 |
10 | 130043646136 |
11 | 50173280118 |
12 | 2125342b7b4 |
13 | c355c46b51 |
14 | 64191cb46c |
15 | 35b1ad5a91 |
hex | 1e473490b8 |
130043646136 has 32 divisors (see below), whose sum is σ = 250107336000. Its totient is φ = 63360441216.
The previous prime is 130043646119. The next prime is 130043646149. The reversal of 130043646136 is 631646340031.
It is a super-2 number, since 2×1300436461362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130043646095 and 130043646104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 669051 + ... + 841258.
It is an arithmetic number, because the mean of its divisors is an integer number (7815854250).
Almost surely, 2130043646136 is an apocalyptic number.
It is an amenable number.
130043646136 is a deficient number, since it is larger than the sum of its proper divisors (120063689864).
130043646136 is a wasteful number, since it uses less digits than its factorization.
130043646136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510591 (or 1510587 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 37.
Adding to 130043646136 its reverse (631646340031), we get a palindrome (761689986167).
The spelling of 130043646136 in words is "one hundred thirty billion, forty-three million, six hundred forty-six thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •