Base | Representation |
---|---|
bin | 1001001100011111110110… |
… | …0100011000110110110101 |
3 | 1022210112111001010202110011 |
4 | 2103013331210120312311 |
5 | 2311121404412102013 |
6 | 33300340250500221 |
7 | 2062305650640334 |
oct | 223077544306665 |
9 | 38715431122404 |
10 | 10110312222133 |
11 | 3248839746252 |
12 | 1173543134671 |
13 | 584524242346 |
14 | 26d4ad987d1b |
15 | 127ed4660c3d |
hex | 931fd918db5 |
10110312222133 has 4 divisors (see below), whose sum is σ = 10110361055328. Its totient is φ = 10110263388940.
The previous prime is 10110312222113. The next prime is 10110312222139. The reversal of 10110312222133 is 33122221301101.
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 a de Polignac number, because none of the positive numbers 2k-10110312222133 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 (10110312222139) 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, 24104713 + ... + 24520558.
It is an arithmetic number, because the mean of its divisors is an integer number (2527590263832).
Almost surely, 210110312222133 is an apocalyptic number.
It is an amenable number.
10110312222133 is a deficient number, since it is larger than the sum of its proper divisors (48833195).
10110312222133 is an equidigital number, since it uses as much as digits as its factorization.
10110312222133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48833194.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10110312222133 its reverse (33122221301101), we get a palindrome (43232533523234).
The spelling of 10110312222133 in words is "ten trillion, one hundred ten billion, three hundred twelve million, two hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •