Base | Representation |
---|---|
bin | 11000010000000000… |
… | …01000111001001111 |
3 | 1020121022211122121201 |
4 | 30020000020321033 |
5 | 203130400443142 |
6 | 5551513410331 |
7 | 640425000112 |
oct | 141000107117 |
9 | 36538748551 |
10 | 13019156047 |
11 | 5580a796a7 |
12 | 26341099a7 |
13 | 12c634ac41 |
14 | 8b7114579 |
15 | 512e87ab7 |
hex | 308008e4f |
13019156047 has 2 divisors, whose sum is σ = 13019156048. Its totient is φ = 13019156046.
The previous prime is 13019155931. The next prime is 13019156063. The reversal of 13019156047 is 74065191031.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13019156047 - 223 = 13010767439 is a prime.
It is a super-2 number, since 2×130191560472 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13019155997 and 13019156015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13019126047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6509578023 + 6509578024.
It is an arithmetic number, because the mean of its divisors is an integer number (6509578024).
Almost surely, 213019156047 is an apocalyptic number.
13019156047 is a deficient number, since it is larger than the sum of its proper divisors (1).
13019156047 is an equidigital number, since it uses as much as digits as its factorization.
13019156047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 22680, while the sum is 37.
The spelling of 13019156047 in words is "thirteen billion, nineteen million, one hundred fifty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •