Base | Representation |
---|---|
bin | 1001001100100010111001… |
… | …1100011001100000010111 |
3 | 1022210121121012002112000110 |
4 | 2103020232130121200113 |
5 | 2311130044321224343 |
6 | 33300553502014103 |
7 | 2062335165506151 |
oct | 223105634314027 |
9 | 38717535075013 |
10 | 10111132211223 |
11 | 324911a59a18a |
12 | 1173731877333 |
13 | 5846250a36a4 |
14 | 26d54a837ad1 |
15 | 128031635833 |
hex | 9322e719817 |
10111132211223 has 4 divisors (see below), whose sum is σ = 13481509614968. Its totient is φ = 6740754807480.
The previous prime is 10111132211207. The next prime is 10111132211261. The reversal of 10111132211223 is 32211223111101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10111132211223 - 24 = 10111132211207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111132211223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111132211023) 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, 1685188701868 + ... + 1685188701873.
It is an arithmetic number, because the mean of its divisors is an integer number (3370377403742).
Almost surely, 210111132211223 is an apocalyptic number.
10111132211223 is a deficient number, since it is larger than the sum of its proper divisors (3370377403745).
10111132211223 is an equidigital number, since it uses as much as digits as its factorization.
10111132211223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3370377403744.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 10111132211223 its reverse (32211223111101), we get a palindrome (42322355322324).
The spelling of 10111132211223 in words is "ten trillion, one hundred eleven billion, one hundred thirty-two million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •