Base | Representation |
---|---|
bin | 111111010010001… |
… | …0010000001100111 |
3 | 12110222121221101111 |
4 | 1332210102001213 |
5 | 13322100041411 |
6 | 550412405451 |
7 | 103422641563 |
oct | 17644220147 |
9 | 5428557344 |
10 | 2123440231 |
11 | 99a699090 |
12 | 4b3176887 |
13 | 27ac07113 |
14 | 16202c6a3 |
15 | c6647721 |
hex | 7e912067 |
2123440231 has 8 divisors (see below), whose sum is σ = 2342509200. Its totient is φ = 1908709440.
The previous prime is 2123440223. The next prime is 2123440243. The reversal of 2123440231 is 1320443212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2123440231 - 23 = 2123440223 is a prime.
It is a super-2 number, since 2×21234402312 = 9017996829258666722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2123440271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1083516 + ... + 1085473.
It is an arithmetic number, because the mean of its divisors is an integer number (292813650).
Almost surely, 22123440231 is an apocalyptic number.
2123440231 is a deficient number, since it is larger than the sum of its proper divisors (219068969).
2123440231 is a wasteful number, since it uses less digits than its factorization.
2123440231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2169089.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2123440231 is about 46080.8011106578. The cubic root of 2123440231 is about 1285.3261610555.
Adding to 2123440231 its reverse (1320443212), we get a palindrome (3443883443).
It can be divided in two parts, 212 and 3440231, that added together give a palindrome (3440443).
The spelling of 2123440231 in words is "two billion, one hundred twenty-three million, four hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •