Base | Representation |
---|---|
bin | 1000010011111010… |
… | …1010111100001011 |
3 | 12202111001121220101 |
4 | 2010332222330023 |
5 | 14032120140243 |
6 | 1005214310231 |
7 | 106200240226 |
oct | 20476527413 |
9 | 5674047811 |
10 | 2231021323 |
11 | a45398383 |
12 | 5231b8377 |
13 | 2972a347b |
14 | 1724345bd |
15 | d0ce854d |
hex | 84faaf0b |
2231021323 has 2 divisors, whose sum is σ = 2231021324. Its totient is φ = 2231021322.
The previous prime is 2231021311. The next prime is 2231021327. The reversal of 2231021323 is 3231201322.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2231021323 - 25 = 2231021291 is a prime.
It is a super-3 number, since 3×22310213233 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2231021323.
It is not a weakly prime, because it can be changed into another prime (2231021327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1115510661 + 1115510662.
It is an arithmetic number, because the mean of its divisors is an integer number (1115510662).
Almost surely, 22231021323 is an apocalyptic number.
2231021323 is a deficient number, since it is larger than the sum of its proper divisors (1).
2231021323 is an equidigital number, since it uses as much as digits as its factorization.
2231021323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2231021323 is about 47233.6884331512. The cubic root of 2231021323 is about 1306.6759778320.
Adding to 2231021323 its reverse (3231201322), we get a palindrome (5462222645).
The spelling of 2231021323 in words is "two billion, two hundred thirty-one million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •