Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …1000101101101001000101 |
3 | 1100010020010000200202221011 |
4 | 2110130213220231221011 |
5 | 2314114040322442013 |
6 | 33410212223122221 |
7 | 2102004356646103 |
oct | 224344750555105 |
9 | 40106100622834 |
10 | 10201212312133 |
11 | 3283345450277 |
12 | 1189091443371 |
13 | 58cc7c68cc4b |
14 | 273a54226c73 |
15 | 12a554a35c3d |
hex | 94727a2da45 |
10201212312133 has 4 divisors (see below), whose sum is σ = 10438449807808. Its totient is φ = 9963974816460.
The previous prime is 10201212312119. The next prime is 10201212312169. The reversal of 10201212312133 is 33121321210201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10201212312133 - 221 = 10201210214981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201212312433) 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, 118618747773 + ... + 118618747858.
It is an arithmetic number, because the mean of its divisors is an integer number (2609612451952).
Almost surely, 210201212312133 is an apocalyptic number.
It is an amenable number.
10201212312133 is a deficient number, since it is larger than the sum of its proper divisors (237237495675).
10201212312133 is an equidigital number, since it uses as much as digits as its factorization.
10201212312133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237237495674.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10201212312133 its reverse (33121321210201), we get a palindrome (43322533522334).
The spelling of 10201212312133 in words is "ten trillion, two hundred one billion, two hundred twelve million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •