Base | Representation |
---|---|
bin | 1011110110000111100001… |
… | …0101011010000010000111 |
3 | 1201010010011000121110202001 |
4 | 2331201320111122002013 |
5 | 3201342342042002142 |
6 | 43411150325530131 |
7 | 2512656526655425 |
oct | 275417025320207 |
9 | 51103130543661 |
10 | 13024359719047 |
11 | 4171666576206 |
12 | 156425b873947 |
13 | 736265661661 |
14 | 33054d33c115 |
15 | 178bd80315b7 |
hex | bd87855a087 |
13024359719047 has 2 divisors, whose sum is σ = 13024359719048. Its totient is φ = 13024359719046.
The previous prime is 13024359718973. The next prime is 13024359719093. The reversal of 13024359719047 is 74091795342031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13024359719047 - 27 = 13024359718919 is a prime.
It is a super-2 number, since 2×130243597190472 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13024359711047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6512179859523 + 6512179859524.
It is an arithmetic number, because the mean of its divisors is an integer number (6512179859524).
Almost surely, 213024359719047 is an apocalyptic number.
13024359719047 is a deficient number, since it is larger than the sum of its proper divisors (1).
13024359719047 is an equidigital number, since it uses as much as digits as its factorization.
13024359719047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5715360, while the sum is 55.
The spelling of 13024359719047 in words is "thirteen trillion, twenty-four billion, three hundred fifty-nine million, seven hundred nineteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •