Base | Representation |
---|---|
bin | 11000011000011001… |
… | …11100111100111101 |
3 | 1020210020102210022001 |
4 | 30030030330330331 |
5 | 203301420430434 |
6 | 10002512022301 |
7 | 642241652500 |
oct | 141414747475 |
9 | 36706383261 |
10 | 13089623869 |
11 | 560782a173 |
12 | 2653831991 |
13 | 1307b2168a |
14 | 8c2619137 |
15 | 519257114 |
hex | 30c33cf3d |
13089623869 has 6 divisors (see below), whose sum is σ = 15226705374. Its totient is φ = 11219677560.
The previous prime is 13089623821. The next prime is 13089623893. The reversal of 13089623869 is 96832698031.
It can be written as a sum of positive squares in only one way, i.e., 12093400900 + 996222969 = 109970^2 + 31563^2 .
It is not a de Polignac number, because 13089623869 - 217 = 13089492797 is a prime.
It is a super-2 number, since 2×130896238692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13089623369) 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 in 5 ways as a sum of consecutive naturals, for example, 133567542 + ... + 133567639.
It is an arithmetic number, because the mean of its divisors is an integer number (2537784229).
Almost surely, 213089623869 is an apocalyptic number.
It is an amenable number.
13089623869 is a deficient number, since it is larger than the sum of its proper divisors (2137081505).
13089623869 is an equidigital number, since it uses as much as digits as its factorization.
13089623869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267135195 (or 267135188 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 55.
The spelling of 13089623869 in words is "thirteen billion, eighty-nine million, six hundred twenty-three thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •