Base | Representation |
---|---|
bin | 1100001111011110010… |
… | …1000100101100101011 |
3 | 202002212000100201022200 |
4 | 3003313211010230223 |
5 | 11421204400334011 |
6 | 240341022351243 |
7 | 21123505351050 |
oct | 3036745045453 |
9 | 662760321280 |
10 | 210312121131 |
11 | 81213789462 |
12 | 3491512b523 |
13 | 16aa888c5b8 |
14 | a271891027 |
15 | 570d937856 |
hex | 30f7944b2b |
210312121131 has 48 divisors (see below), whose sum is σ = 367701856704. Its totient is φ = 113079048192.
The previous prime is 210312121111. The next prime is 210312121181. The reversal of 210312121131 is 131121213012.
210312121131 is a `hidden beast` number, since 210 + 312 + 12 + 1 + 131 = 666.
It is not a de Polignac number, because 210312121131 - 26 = 210312121067 is a prime.
It is a super-2 number, since 2×2103121211312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210312121111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4359615 + ... + 4407591.
It is an arithmetic number, because the mean of its divisors is an integer number (7660455348).
Almost surely, 2210312121131 is an apocalyptic number.
210312121131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
210312121131 is a deficient number, since it is larger than the sum of its proper divisors (157389735573).
210312121131 is a wasteful number, since it uses less digits than its factorization.
210312121131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52100 (or 52097 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 210312121131 its reverse (131121213012), we get a palindrome (341433334143).
The spelling of 210312121131 in words is "two hundred ten billion, three hundred twelve million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •