Base | Representation |
---|---|
bin | 11000010101111100… |
… | …11110110010011001 |
3 | 1020201210201200111000 |
4 | 30022332132302121 |
5 | 203231134144311 |
6 | 10000455055213 |
7 | 641602055400 |
oct | 141276366231 |
9 | 36653650430 |
10 | 13069053081 |
11 | 55a715a017 |
12 | 2648971509 |
13 | 130379b506 |
14 | 8bd9c2637 |
15 | 517542056 |
hex | 30af9ec99 |
13069053081 has 192 divisors, whose sum is σ = 24702796800. Its totient is φ = 6785275392.
The previous prime is 13069053079. The next prime is 13069053083. The reversal of 13069053081 is 18035096031.
It is a happy number.
13069053081 is a `hidden beast` number, since 1 + 30 + 6 + 90 + 530 + 8 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (13069053079) and next prime (13069053083).
It is not a de Polignac number, because 13069053081 - 21 = 13069053079 is a prime.
It is a super-2 number, since 2×130690530812 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13069053083) 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 191 ways as a sum of consecutive naturals, for example, 115655281 + ... + 115655393.
It is an arithmetic number, because the mean of its divisors is an integer number (128660400).
Almost surely, 213069053081 is an apocalyptic number.
It is an amenable number.
13069053081 is a deficient number, since it is larger than the sum of its proper divisors (11633743719).
13069053081 is a wasteful number, since it uses less digits than its factorization.
13069053081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305 (or 292 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The spelling of 13069053081 in words is "thirteen billion, sixty-nine million, fifty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •