Base | Representation |
---|---|
bin | 110000001101000000100000… |
… | …011100100111011011110111 |
3 | 1000210122000101120112002011122 |
4 | 300031000200130213123313 |
5 | 210241402231301244111 |
6 | 2030515303144054155 |
7 | 62440334566230254 |
oct | 6015004034473367 |
9 | 1023560346462148 |
10 | 212000130103031 |
11 | 6160582867a516 |
12 | 1b93b06676435b |
13 | 913a6ac9020ba |
14 | 3a4cc0a9cc42b |
15 | 197992360dcdb |
hex | c0d0207276f7 |
212000130103031 has 4 divisors (see below), whose sum is σ = 212001494629872. Its totient is φ = 211998765576192.
The previous prime is 212000130102989. The next prime is 212000130103037. The reversal of 212000130103031 is 130301031000212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212000130103031 - 26 = 212000130102967 is a prime.
It is a super-2 number, since 2×2120001301030312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212000130103037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 682030346 + ... + 682341111.
It is an arithmetic number, because the mean of its divisors is an integer number (53000373657468).
Almost surely, 2212000130103031 is an apocalyptic number.
212000130103031 is a deficient number, since it is larger than the sum of its proper divisors (1364526841).
212000130103031 is a wasteful number, since it uses less digits than its factorization.
212000130103031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1364526840.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 212000130103031 its reverse (130301031000212), we get a palindrome (342301161103243).
The spelling of 212000130103031 in words is "two hundred twelve trillion, one hundred thirty million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •