Base | Representation |
---|---|
bin | 1100000111111010011111… |
… | …1111101100000010011101 |
3 | 1202012100022201200002211100 |
4 | 3001332213333230002131 |
5 | 3221400022103310023 |
6 | 44203433032143313 |
7 | 2544032232366135 |
oct | 301764777540235 |
9 | 52170281602740 |
10 | 13330102010013 |
11 | 427a2a0084718 |
12 | 15b3568237b39 |
13 | 75903c047769 |
14 | 341274d67ac5 |
15 | 181b2e8bec43 |
hex | c1fa7fec09d |
13330102010013 has 12 divisors (see below), whose sum is σ = 19256331442140. Its totient is φ = 8885931758016.
The previous prime is 13330102010003. The next prime is 13330102010021. The reversal of 13330102010013 is 31001020103331.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 6133260277764 + 7196841732249 = 2476542^2 + 2682693^2 .
It is not a de Polignac number, because 13330102010013 - 25 = 13330102009981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330102010003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66804456 + ... + 67003697.
It is an arithmetic number, because the mean of its divisors is an integer number (1604694286845).
Almost surely, 213330102010013 is an apocalyptic number.
It is an amenable number.
13330102010013 is a deficient number, since it is larger than the sum of its proper divisors (5926229432127).
13330102010013 is a wasteful number, since it uses less digits than its factorization.
13330102010013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133819228 (or 133819225 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 13330102010013 its reverse (31001020103331), we get a palindrome (44331122113344).
The spelling of 13330102010013 in words is "thirteen trillion, three hundred thirty billion, one hundred two million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •