Base | Representation |
---|---|
bin | 11101011011010110001… |
… | …11000011100011010111 |
3 | 10120122212021222200211022 |
4 | 32231223013003203113 |
5 | 113031230231414411 |
6 | 2052255521031355 |
7 | 133023232652342 |
oct | 16555307034327 |
9 | 3518767880738 |
10 | 1011114326231 |
11 | 35a8a174a779 |
12 | 143b6418555b |
13 | 74469ab1739 |
14 | 36d1c597459 |
15 | 1b47c389edb |
hex | eb6b1c38d7 |
1011114326231 has 2 divisors, whose sum is σ = 1011114326232. Its totient is φ = 1011114326230.
The previous prime is 1011114326207. The next prime is 1011114326249. The reversal of 1011114326231 is 1326234111101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1011114326231 - 230 = 1010040584407 is a prime.
It is a super-2 number, since 2×10111143262312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1011114326231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011114326531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505557163115 + 505557163116.
It is an arithmetic number, because the mean of its divisors is an integer number (505557163116).
Almost surely, 21011114326231 is an apocalyptic number.
1011114326231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011114326231 is an equidigital number, since it uses as much as digits as its factorization.
1011114326231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 1011114326231 its reverse (1326234111101), we get a palindrome (2337348437332).
The spelling of 1011114326231 in words is "one trillion, eleven billion, one hundred fourteen million, three hundred twenty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •