Base | Representation |
---|---|
bin | 1001000111010111100110… |
… | …1111111110011010101101 |
3 | 1022111010001102221012222110 |
4 | 2101311321233332122231 |
5 | 2303200432014234013 |
6 | 33152045152234233 |
7 | 2053036330432131 |
oct | 221657157763255 |
9 | 38433042835873 |
10 | 10022201321133 |
11 | 3214434405201 |
12 | 115a452b3b979 |
13 | 579121907c31 |
14 | 2691119173c1 |
15 | 125a7908c2c3 |
hex | 91d79bfe6ad |
10022201321133 has 4 divisors (see below), whose sum is σ = 13362935094848. Its totient is φ = 6681467547420.
The previous prime is 10022201321051. The next prime is 10022201321137. The reversal of 10022201321133 is 33112310222001.
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 not a de Polignac number, because 10022201321133 - 217 = 10022201190061 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 (10022201321137) 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, 1670366886853 + ... + 1670366886858.
It is an arithmetic number, because the mean of its divisors is an integer number (3340733773712).
Almost surely, 210022201321133 is an apocalyptic number.
It is an amenable number.
10022201321133 is a deficient number, since it is larger than the sum of its proper divisors (3340733773715).
10022201321133 is an equidigital number, since it uses as much as digits as its factorization.
10022201321133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3340733773714.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10022201321133 its reverse (33112310222001), we get a palindrome (43134511543134).
The spelling of 10022201321133 in words is "ten trillion, twenty-two billion, two hundred one million, three hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •