Base | Representation |
---|---|
bin | 10011000100001111010… |
… | …100010110111010000110 |
3 | 11122020220121212212212000 |
4 | 103010033110112322012 |
5 | 132431313314121410 |
6 | 2441524021010130 |
7 | 163442344262544 |
oct | 23041724267206 |
9 | 4566817785760 |
10 | 1310222020230 |
11 | 46573119a2a2 |
12 | 191b1a853946 |
13 | 96726aaba16 |
14 | 475b4dc2d94 |
15 | 2413653bdc0 |
hex | 1310f516e86 |
1310222020230 has 32 divisors (see below), whose sum is σ = 3493925388000. Its totient is φ = 349392538656.
The previous prime is 1310222020157. The next prime is 1310222020253. The reversal of 1310222020230 is 320202220131.
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 pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2426336805 + ... + 2426337344.
It is an arithmetic number, because the mean of its divisors is an integer number (109185168375).
Almost surely, 21310222020230 is an apocalyptic number.
1310222020230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1310222020230 is an abundant number, since it is smaller than the sum of its proper divisors (2183703367770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310222020230 is a wasteful number, since it uses less digits than its factorization.
1310222020230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852674165 (or 4852674159 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 1310222020230 its reverse (320202220131), we get a palindrome (1630424240361).
The spelling of 1310222020230 in words is "one trillion, three hundred ten billion, two hundred twenty-two million, twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •