Base | Representation |
---|---|
bin | 111111001110010… |
… | …0001010000001101 |
3 | 12110211210120012100 |
4 | 1332130201100031 |
5 | 13321034433303 |
6 | 550301025313 |
7 | 103366435356 |
oct | 17634412015 |
9 | 5424716170 |
10 | 2121405453 |
11 | 999529352 |
12 | 4b2555239 |
13 | 27a673bcb |
14 | 161a5cd2d |
15 | c63948a3 |
hex | 7e72140d |
2121405453 has 6 divisors (see below), whose sum is σ = 3064252334. Its totient is φ = 1414270296.
The previous prime is 2121405443. The next prime is 2121405457. The reversal of 2121405453 is 3545041212.
2121405453 is a `hidden beast` number, since 212 + 1 + 405 + 45 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1122719049 + 998686404 = 33507^2 + 31602^2 .
It is not a de Polignac number, because 2121405453 - 210 = 2121404429 is a prime.
It is a super-2 number, since 2×21214054532 = 9000722192036270418, 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 (2121405457) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 117855850 + ... + 117855867.
Almost surely, 22121405453 is an apocalyptic number.
It is an amenable number.
2121405453 is a deficient number, since it is larger than the sum of its proper divisors (942846881).
2121405453 is a wasteful number, since it uses less digits than its factorization.
2121405453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235711723 (or 235711720 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 2121405453 is about 46058.7174484918. The cubic root of 2121405453 is about 1284.9154769863.
Adding to 2121405453 its reverse (3545041212), we get a palindrome (5666446665).
The spelling of 2121405453 in words is "two billion, one hundred twenty-one million, four hundred five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •