Base | Representation |
---|---|
bin | 1011111101000010110000… |
… | …0111111100010011111110 |
3 | 1201112111020222101102022110 |
4 | 2333100230013330103332 |
5 | 3210320030043032220 |
6 | 43541544522354450 |
7 | 2524401136264530 |
oct | 277205407742376 |
9 | 51474228342273 |
10 | 13143340205310 |
11 | 4208071999597 |
12 | 158332605ba26 |
13 | 744547568853 |
14 | 3361d90d7850 |
15 | 17bd4d74dbe0 |
hex | bf42c1fc4fe |
13143340205310 has 64 divisors (see below), whose sum is σ = 36053062156800. Its totient is φ = 3003962247552.
The previous prime is 13143340205291. The next prime is 13143340205321. The reversal of 13143340205310 is 1350204334131.
It is a happy number.
It is a super-2 number, since 2×131433402053102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 365701 + ... + 5140079.
It is an arithmetic number, because the mean of its divisors is an integer number (563329096200).
Almost surely, 213143340205310 is an apocalyptic number.
13143340205310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13143340205310 is an abundant number, since it is smaller than the sum of its proper divisors (22909721951490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13143340205310 is a wasteful number, since it uses less digits than its factorization.
13143340205310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4787505.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 13143340205310 its reverse (1350204334131), we get a palindrome (14493544539441).
The spelling of 13143340205310 in words is "thirteen trillion, one hundred forty-three billion, three hundred forty million, two hundred five thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •