Base | Representation |
---|---|
bin | 1011111011101011111000… |
… | …1101000111011011001110 |
3 | 1201110021001211121210122202 |
4 | 2332322332031013123032 |
5 | 3204424300413400220 |
6 | 43523130552041502 |
7 | 2522614233261560 |
oct | 276727615073316 |
9 | 51407054553582 |
10 | 13120021231310 |
11 | 41a9195a46254 |
12 | 157a8b8693292 |
13 | 74229c397496 |
14 | 3350260d7330 |
15 | 17b436433275 |
hex | beebe3476ce |
13120021231310 has 64 divisors (see below), whose sum is σ = 27264117763584. Its totient is φ = 4452589680000.
The previous prime is 13120021231309. The next prime is 13120021231319. The reversal of 13120021231310 is 1313212002131.
It is a happy number.
It is a super-2 number, since 2×131200212313102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13120021231319) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26985629 + ... + 27467511.
It is an arithmetic number, because the mean of its divisors is an integer number (426001840056).
Almost surely, 213120021231310 is an apocalyptic number.
13120021231310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13120021231310 is an abundant number, since it is smaller than the sum of its proper divisors (14144096532274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13120021231310 is a wasteful number, since it uses less digits than its factorization.
13120021231310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485849.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13120021231310 its reverse (1313212002131), we get a palindrome (14433233233441).
The spelling of 13120021231310 in words is "thirteen trillion, one hundred twenty billion, twenty-one million, two hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •