Base | Representation |
---|---|
bin | 111111010001010… |
… | …1011110000001011 |
3 | 12110221211122202101 |
4 | 1332202223300023 |
5 | 13321443140243 |
6 | 550355414231 |
7 | 103416245353 |
oct | 17642536013 |
9 | 5427748671 |
10 | 2123021323 |
11 | 99a432385 |
12 | 4b2bb4377 |
13 | 27aabb547 |
14 | 161d5db63 |
15 | c65b354d |
hex | 7e8abc0b |
2123021323 has 4 divisors (see below), whose sum is σ = 2126903080. Its totient is φ = 2119139568.
The previous prime is 2123021311. The next prime is 2123021363. The reversal of 2123021323 is 3231203212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2123021323 - 25 = 2123021291 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2123021323.
It is not an unprimeable number, because it can be changed into a prime (2123021363) 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 in 3 ways as a sum of consecutive naturals, for example, 1940058 + ... + 1941151.
It is an arithmetic number, because the mean of its divisors is an integer number (531725770).
Almost surely, 22123021323 is an apocalyptic number.
2123021323 is a deficient number, since it is larger than the sum of its proper divisors (3881757).
2123021323 is an equidigital number, since it uses as much as digits as its factorization.
2123021323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3881756.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2123021323 is about 46076.2555227744. The cubic root of 2123021323 is about 1285.2416333137.
Adding to 2123021323 its reverse (3231203212), we get a palindrome (5354224535).
The spelling of 2123021323 in words is "two billion, one hundred twenty-three million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •