Base | Representation |
---|---|
bin | 10000010100001000001… |
… | …001101110010100100011 |
3 | 10222011211000011002021001 |
4 | 100110020021232110203 |
5 | 121332030021343021 |
6 | 2215011545412431 |
7 | 143666323141300 |
oct | 20241011562443 |
9 | 3864730132231 |
10 | 1121123231011 |
11 | 3a2513922103 |
12 | 161345a9a117 |
13 | 8194c0a8834 |
14 | 3c396a180a7 |
15 | 1e26a141091 |
hex | 1050826e523 |
1121123231011 has 12 divisors (see below), whose sum is σ = 1349134924320. Its totient is φ = 927826121040.
The previous prime is 1121123231003. The next prime is 1121123231023. The reversal of 1121123231011 is 1101323211211.
It is not a de Polignac number, because 1121123231011 - 23 = 1121123231003 is a prime.
It is a super-2 number, since 2×11211232310112 (a number of 25 digits) contains 22 as substring.
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 1121123231011.
It is not an unprimeable number, because it can be changed into a prime (1121123231611) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 394482475 + ... + 394485316.
It is an arithmetic number, because the mean of its divisors is an integer number (112427910360).
Almost surely, 21121123231011 is an apocalyptic number.
1121123231011 is a deficient number, since it is larger than the sum of its proper divisors (228011693309).
1121123231011 is an equidigital number, since it uses as much as digits as its factorization.
1121123231011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788967834 (or 788967827 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1121123231011 its reverse (1101323211211), we get a palindrome (2222446442222).
The spelling of 1121123231011 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-three million, two hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •