Base | Representation |
---|---|
bin | 111100100111010011… |
… | …0110011100100001001 |
3 | 110102222121201002201022 |
4 | 1321032212303210021 |
5 | 4113040430030114 |
6 | 135444232002225 |
7 | 12255452111123 |
oct | 1711646634411 |
9 | 412877632638 |
10 | 130167814409 |
11 | 50227379626 |
12 | 21288b30375 |
13 | c3758a00b9 |
14 | 642b8b0213 |
15 | 35bc96148e |
hex | 1e4e9b3909 |
130167814409 has 2 divisors, whose sum is σ = 130167814410. Its totient is φ = 130167814408.
The previous prime is 130167814391. The next prime is 130167814411. The reversal of 130167814409 is 904418761031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93611521600 + 36556292809 = 305960^2 + 191197^2 .
It is a cyclic number.
It is not a de Polignac number, because 130167814409 - 228 = 129899378953 is a prime.
Together with 130167814411, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130167814409.
It is not a weakly prime, because it can be changed into another prime (130167814489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65083907204 + 65083907205.
It is an arithmetic number, because the mean of its divisors is an integer number (65083907205).
Almost surely, 2130167814409 is an apocalyptic number.
It is an amenable number.
130167814409 is a deficient number, since it is larger than the sum of its proper divisors (1).
130167814409 is an equidigital number, since it uses as much as digits as its factorization.
130167814409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 44.
The spelling of 130167814409 in words is "one hundred thirty billion, one hundred sixty-seven million, eight hundred fourteen thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •