Base | Representation |
---|---|
bin | 1000101001111111… |
… | …1000001001000111 |
3 | 12222221021201202021 |
4 | 2022133320021013 |
5 | 14224321042411 |
6 | 1022323024011 |
7 | 111403243453 |
oct | 21237701107 |
9 | 5887251667 |
10 | 2323612231 |
11 | a92689296 |
12 | 54a20b007 |
13 | 2b05217a5 |
14 | 180857663 |
15 | d8ed7a71 |
hex | 8a7f8247 |
2323612231 has 2 divisors, whose sum is σ = 2323612232. Its totient is φ = 2323612230.
The previous prime is 2323612189. The next prime is 2323612261. The reversal of 2323612231 is 1322163232.
2323612231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2323612231 - 27 = 2323612103 is a prime.
It is a super-2 number, since 2×23236122312 = 10798347600105594722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2323612196 and 2323612205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2323612261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1161806115 + 1161806116.
It is an arithmetic number, because the mean of its divisors is an integer number (1161806116).
Almost surely, 22323612231 is an apocalyptic number.
2323612231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2323612231 is an equidigital number, since it uses as much as digits as its factorization.
2323612231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 25.
The square root of 2323612231 is about 48203.8611627741. The cubic root of 2323612231 is about 1324.5078948149.
Adding to 2323612231 its reverse (1322163232), we get a palindrome (3645775463).
The spelling of 2323612231 in words is "two billion, three hundred twenty-three million, six hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •