Base | Representation |
---|---|
bin | 10000011101100010100… |
… | …111111000100010100111 |
3 | 11000010220102202000202111 |
4 | 100131202213320202213 |
5 | 122013230120134343 |
6 | 2223402542421451 |
7 | 144504650012362 |
oct | 20354247704247 |
9 | 4003812660674 |
10 | 1131231021223 |
11 | 3a6830469536 |
12 | 1632a6b91887 |
13 | 828a02065a4 |
14 | 3ca751d90d9 |
15 | 1e65c6e1c9d |
hex | 107629f88a7 |
1131231021223 has 2 divisors, whose sum is σ = 1131231021224. Its totient is φ = 1131231021222.
The previous prime is 1131231021169. The next prime is 1131231021299. The reversal of 1131231021223 is 3221201321311.
It is a weak prime.
It is an emirp because it is prime and its reverse (3221201321311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1131231021223 is a prime.
It is a super-4 number, since 4×11312310212234 (a number of 49 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1131231021194 and 1131231021203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131231021623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565615510611 + 565615510612.
It is an arithmetic number, because the mean of its divisors is an integer number (565615510612).
Almost surely, 21131231021223 is an apocalyptic number.
1131231021223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131231021223 is an equidigital number, since it uses as much as digits as its factorization.
1131231021223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1131231021223 its reverse (3221201321311), we get a palindrome (4352432342534).
The spelling of 1131231021223 in words is "one trillion, one hundred thirty-one billion, two hundred thirty-one million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •