Base | Representation |
---|---|
bin | 101111110001110010110101… |
… | …110111011111011100010110 |
3 | 1000120000020100011112022021002 |
4 | 233301302311313133130112 |
5 | 210020232300442243220 |
6 | 2022524223110423302 |
7 | 62155252030024346 |
oct | 5761626567373426 |
9 | 1016006304468232 |
10 | 210130031212310 |
11 | 60a547115a47a0 |
12 | 1b698736361b32 |
13 | 903323b8c9941 |
14 | 39c64c2424d26 |
15 | 1945e6e95dc75 |
hex | bf1cb5ddf716 |
210130031212310 has 32 divisors (see below), whose sum is σ = 412663164211872. Its totient is φ = 76402736398080.
The previous prime is 210130031212289. The next prime is 210130031212331. The reversal of 210130031212310 is 13212130031012.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (210130031212289) and next prime (210130031212331).
It is a super-2 number, since 2×2101300312123102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101268797 + ... + 103322936.
It is an arithmetic number, because the mean of its divisors is an integer number (12895723881621).
Almost surely, 2210130031212310 is an apocalyptic number.
210130031212310 is a deficient number, since it is larger than the sum of its proper divisors (202533132999562).
210130031212310 is a wasteful number, since it uses less digits than its factorization.
210130031212310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204601088.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 210130031212310 its reverse (13212130031012), we get a palindrome (223342161243322).
The spelling of 210130031212310 in words is "two hundred ten trillion, one hundred thirty billion, thirty-one million, two hundred twelve thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •