Base | Representation |
---|---|
bin | 1011111011101111100111… |
… | …1011101101011000001010 |
3 | 1201110100122200012020000210 |
4 | 2332323321323231120022 |
5 | 3204433323431114010 |
6 | 43523414225541550 |
7 | 2522651121603123 |
oct | 276737173553012 |
9 | 51410580166023 |
10 | 13121023301130 |
11 | 41a965a653128 |
12 | 157ab381a48b6 |
13 | 7423cbb7a7c4 |
14 | 3350bd22304a |
15 | 17b4943c2b20 |
hex | beef9eed60a |
13121023301130 has 32 divisors (see below), whose sum is σ = 31504750432704. Its totient is φ = 3497351268096.
The previous prime is 13121023301123. The next prime is 13121023301159. The reversal of 13121023301130 is 3110332012131.
It is a happy number.
It is a super-2 number, since 2×131210233011302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13121023301097 and 13121023301106.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 99200239 + ... + 99332418.
It is an arithmetic number, because the mean of its divisors is an integer number (984523451022).
Almost surely, 213121023301130 is an apocalyptic number.
13121023301130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13121023301130 is an abundant number, since it is smaller than the sum of its proper divisors (18383727131574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13121023301130 is a wasteful number, since it uses less digits than its factorization.
13121023301130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198534870.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13121023301130 its reverse (3110332012131), we get a palindrome (16231355313261).
The spelling of 13121023301130 in words is "thirteen trillion, one hundred twenty-one billion, twenty-three million, three hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •