Base | Representation |
---|---|
bin | 10011000100001010011… |
… | …100010100011010101100 |
3 | 11122020200220222001112121 |
4 | 103010022130110122230 |
5 | 132431131344033400 |
6 | 2441511535442324 |
7 | 163440332064244 |
oct | 23041234243254 |
9 | 4566626861477 |
10 | 1310140221100 |
11 | 465699aaa407 |
12 | 191ab73863a4 |
13 | 96712b6b779 |
14 | 475a81acb24 |
15 | 2412e28021a |
hex | 1310a7146ac |
1310140221100 has 36 divisors (see below), whose sum is σ = 2847798682344. Its totient is φ = 523172327680.
The previous prime is 1310140221079. The next prime is 1310140221109. The reversal of 1310140221100 is 11220410131.
It is not an unprimeable number, because it can be changed into a prime (1310140221109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10987414 + ... + 11106013.
It is an arithmetic number, because the mean of its divisors is an integer number (79105518954).
Almost surely, 21310140221100 is an apocalyptic number.
1310140221100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1310140221100 is an abundant number, since it is smaller than the sum of its proper divisors (1537658461244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310140221100 is a wasteful number, since it uses less digits than its factorization.
1310140221100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22094034 (or 22094027 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1310140221100 its reverse (11220410131), we get a palindrome (1321360631231).
The spelling of 1310140221100 in words is "one trillion, three hundred ten billion, one hundred forty million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •