Base | Representation |
---|---|
bin | 11101101000100000001001… |
… | …011001001010111110011101 |
3 | 122002110002211222121220110002 |
4 | 131220200021121022332131 |
5 | 114040232432134121300 |
6 | 1141103122334424045 |
7 | 36310534522250015 |
oct | 3550401131127635 |
9 | 562402758556402 |
10 | 130326645223325 |
11 | 38587246690151 |
12 | 1274a215962025 |
13 | 5794999728215 |
14 | 2427bb3d90c45 |
15 | 10101660ad5d5 |
hex | 76880964af9d |
130326645223325 has 24 divisors (see below), whose sum is σ = 168647036428608. Its totient is φ = 99718936289280.
The previous prime is 130326645223289. The next prime is 130326645223387. The reversal of 130326645223325 is 523322546623031.
It is not a de Polignac number, because 130326645223325 - 232 = 130322350256029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130326645223325.
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 23 ways as a sum of consecutive naturals, for example, 4356179 + ... + 16722128.
It is an arithmetic number, because the mean of its divisors is an integer number (7026959851192).
Almost surely, 2130326645223325 is an apocalyptic number.
It is an amenable number.
130326645223325 is a deficient number, since it is larger than the sum of its proper divisors (38320391205283).
130326645223325 is a wasteful number, since it uses less digits than its factorization.
130326645223325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21089093 (or 21089088 counting only the distinct ones).
The product of its (nonzero) digits is 4665600, while the sum is 47.
The spelling of 130326645223325 in words is "one hundred thirty trillion, three hundred twenty-six billion, six hundred forty-five million, two hundred twenty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •