Base | Representation |
---|---|
bin | 111100111110011101… |
… | …1000101110101010011 |
3 | 110111222202220022212102 |
4 | 1321330323011311103 |
5 | 4121133342242201 |
6 | 140053311151015 |
7 | 12313636102232 |
oct | 1717473056523 |
9 | 414882808772 |
10 | 130944884051 |
11 | 50595a78543 |
12 | 2146521546b |
13 | c46a884b17 |
14 | 64a2b8ab19 |
15 | 3615ca926b |
hex | 1e7cec5d53 |
130944884051 has 2 divisors, whose sum is σ = 130944884052. Its totient is φ = 130944884050.
The previous prime is 130944884047. The next prime is 130944884053. The reversal of 130944884051 is 150488449031.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130944884051 - 22 = 130944884047 is a prime.
Together with 130944884053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 130944883987 and 130944884005.
It is not a weakly prime, because it can be changed into another prime (130944884053) by changing a digit.
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 as a sum of consecutive naturals, namely, 65472442025 + 65472442026.
It is an arithmetic number, because the mean of its divisors is an integer number (65472442026).
Almost surely, 2130944884051 is an apocalyptic number.
130944884051 is a deficient number, since it is larger than the sum of its proper divisors (1).
130944884051 is an equidigital number, since it uses as much as digits as its factorization.
130944884051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 552960, while the sum is 47.
The spelling of 130944884051 in words is "one hundred thirty billion, nine hundred forty-four million, eight hundred eighty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •