Base | Representation |
---|---|
bin | 11110000100000011100101… |
… | …111010110000110001011110 |
3 | 122100011010021020110121120021 |
4 | 132010003211322300301132 |
5 | 114312243311420023104 |
6 | 1145113031154142354 |
7 | 36564406044521260 |
oct | 3604034572606136 |
9 | 570133236417507 |
10 | 132220130626654 |
11 | 39147273848a44 |
12 | 129b51922819ba |
13 | 58a13c68bb115 |
14 | 24916ba4d9b30 |
15 | 1044537e6a754 |
hex | 7840e5eb0c5e |
132220130626654 has 16 divisors (see below), whose sum is σ = 226739838030048. Its totient is φ = 56646581029632.
The previous prime is 132220130626609. The next prime is 132220130626663. The reversal of 132220130626654 is 456626031022231.
It is a self number, because there is not a number n which added to its sum of digits gives 132220130626654.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1599060427 + ... + 1599143110.
It is an arithmetic number, because the mean of its divisors is an integer number (14171239876878).
Almost surely, 2132220130626654 is an apocalyptic number.
132220130626654 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
132220130626654 is a deficient number, since it is larger than the sum of its proper divisors (94519707403394).
132220130626654 is a wasteful number, since it uses less digits than its factorization.
132220130626654 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3198206499.
The product of its (nonzero) digits is 622080, while the sum is 43.
Adding to 132220130626654 its reverse (456626031022231), we get a palindrome (588846161648885).
The spelling of 132220130626654 in words is "one hundred thirty-two trillion, two hundred twenty billion, one hundred thirty million, six hundred twenty-six thousand, six hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •