Base | Representation |
---|---|
bin | 1011110110100000100101… |
… | …0100010101110111110001 |
3 | 1201010202111212101000021012 |
4 | 2331220021110111313301 |
5 | 3202000131244302343 |
6 | 43414222045040305 |
7 | 2513315325541205 |
oct | 275501124256761 |
9 | 51122455330235 |
10 | 13031087103473 |
11 | 41744a8a4a74a |
12 | 1565618856095 |
13 | 736a983370ba |
14 | 3309ca9b2b05 |
15 | 178e7d94a718 |
hex | bda09515df1 |
13031087103473 has 2 divisors, whose sum is σ = 13031087103474. Its totient is φ = 13031087103472.
The previous prime is 13031087103457. The next prime is 13031087103571. The reversal of 13031087103473 is 37430178013031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11104243283809 + 1926843819664 = 3332303^2 + 1388108^2 .
It is a cyclic number.
It is not a de Polignac number, because 13031087103473 - 24 = 13031087103457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13031087103473.
It is not a weakly prime, because it can be changed into another prime (13031087103373) 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, 6515543551736 + 6515543551737.
It is an arithmetic number, because the mean of its divisors is an integer number (6515543551737).
Almost surely, 213031087103473 is an apocalyptic number.
It is an amenable number.
13031087103473 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031087103473 is an equidigital number, since it uses as much as digits as its factorization.
13031087103473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 13031087103473 in words is "thirteen trillion, thirty-one billion, eighty-seven million, one hundred three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •