Base | Representation |
---|---|
bin | 11101011001101100000… |
… | …00001001100001011111 |
3 | 10120120120012102001111012 |
4 | 32230312000021201133 |
5 | 113022414132320411 |
6 | 2052031251445435 |
7 | 132662163365063 |
oct | 16546600114137 |
9 | 3516505361435 |
10 | 1010223323231 |
11 | 35a484802a61 |
12 | 1439558b687b |
13 | 74357318225 |
14 | 36c760ddaa3 |
15 | 1b42903918b |
hex | eb3600985f |
1010223323231 has 2 divisors, whose sum is σ = 1010223323232. Its totient is φ = 1010223323230.
The previous prime is 1010223323227. The next prime is 1010223323293. The reversal of 1010223323231 is 1323233220101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1010223323231 - 22 = 1010223323227 is a prime.
It is a super-2 number, since 2×10102233232312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010223323197 and 1010223323206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010223320231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505111661615 + 505111661616.
It is an arithmetic number, because the mean of its divisors is an integer number (505111661616).
Almost surely, 21010223323231 is an apocalyptic number.
1010223323231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010223323231 is an equidigital number, since it uses as much as digits as its factorization.
1010223323231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1010223323231 its reverse (1323233220101), we get a palindrome (2333456543332).
The spelling of 1010223323231 in words is "one trillion, ten billion, two hundred twenty-three million, three hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •