Base | Representation |
---|---|
bin | 111111001110010… |
… | …0011000110011111 |
3 | 12110211210221120201 |
4 | 1332130203012133 |
5 | 13321040204043 |
6 | 550301124331 |
7 | 103366466422 |
oct | 17634430637 |
9 | 5424727521 |
10 | 2121413023 |
11 | 999534004 |
12 | 4b25596a7 |
13 | 27a6774a2 |
14 | 161a619b9 |
15 | c6396c4d |
hex | 7e72319f |
2121413023 has 8 divisors (see below), whose sum is σ = 2234398320. Its totient is φ = 2008560960.
The previous prime is 2121413003. The next prime is 2121413053. The reversal of 2121413023 is 3203141212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2121413023 - 29 = 2121412511 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121413003) 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 in 7 ways as a sum of consecutive naturals, for example, 261 + ... + 65137.
It is an arithmetic number, because the mean of its divisors is an integer number (279299790).
Almost surely, 22121413023 is an apocalyptic number.
2121413023 is a deficient number, since it is larger than the sum of its proper divisors (112985297).
2121413023 is a wasteful number, since it uses less digits than its factorization.
2121413023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66617.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 2121413023 is about 46058.7996261301. The cubic root of 2121413023 is about 1284.9170053439.
Adding to 2121413023 its reverse (3203141212), we get a palindrome (5324554235).
The spelling of 2121413023 in words is "two billion, one hundred twenty-one million, four hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •