Base | Representation |
---|---|
bin | 11101100101111000001101… |
… | …110011101111110010000111 |
3 | 122001210212102112222122021002 |
4 | 131211320031303233302013 |
5 | 114024304141123003023 |
6 | 1140444222100043515 |
7 | 36261522253664303 |
oct | 3545701563576207 |
9 | 561725375878232 |
10 | 130146330672263 |
11 | 38517826836114 |
12 | 1271b29299359b |
13 | 578099188c9a9 |
14 | 241d18a4b4d03 |
15 | 100a610e6eb28 |
hex | 765e0dcefc87 |
130146330672263 has 4 divisors (see below), whose sum is σ = 130146459132648. Its totient is φ = 130146202211880.
The previous prime is 130146330672257. The next prime is 130146330672283. The reversal of 130146330672263 is 362276033641031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130146330672263 - 238 = 129871452765319 is a prime.
It is a super-3 number, since 3×1301463306722633 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130146330672283) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62698328 + ... + 64740813.
It is an arithmetic number, because the mean of its divisors is an integer number (32536614783162).
Almost surely, 2130146330672263 is an apocalyptic number.
130146330672263 is a deficient number, since it is larger than the sum of its proper divisors (128460385).
130146330672263 is a wasteful number, since it uses less digits than its factorization.
130146330672263 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128460384.
The product of its (nonzero) digits is 1959552, while the sum is 47.
The spelling of 130146330672263 in words is "one hundred thirty trillion, one hundred forty-six billion, three hundred thirty million, six hundred seventy-two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •