Base | Representation |
---|---|
bin | 10011000100001001010… |
… | …011011010101011011000 |
3 | 11122020122121000010100200 |
4 | 103010021103122223120 |
5 | 132431112001011412 |
6 | 2441510014102200 |
7 | 163440010460364 |
oct | 23041123325330 |
9 | 4566577003320 |
10 | 1310121110232 |
11 | 46568a237100 |
12 | 191ab0aaa960 |
13 | 9670bc09c6c |
14 | 475a58362a4 |
15 | 2412c7579dc |
hex | 131094daad8 |
1310121110232 has 144 divisors (see below), whose sum is σ = 4034624958000. Its totient is φ = 383316447360.
The previous prime is 1310121110219. The next prime is 1310121110279. The reversal of 1310121110232 is 2320111210131.
1310121110232 is a `hidden beast` number, since 1 + 310 + 12 + 1 + 110 + 232 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2340132 + ... + 2845427.
It is an arithmetic number, because the mean of its divisors is an integer number (28018228875).
Almost surely, 21310121110232 is an apocalyptic number.
1310121110232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1310121110232 is an abundant number, since it is smaller than the sum of its proper divisors (2724503847768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310121110232 is a wasteful number, since it uses less digits than its factorization.
1310121110232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5185622 (or 5185604 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1310121110232 its reverse (2320111210131), we get a palindrome (3630232320363).
The spelling of 1310121110232 in words is "one trillion, three hundred ten billion, one hundred twenty-one million, one hundred ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •