Base | Representation |
---|---|
bin | 111101001101110… |
… | …0000001110001111 |
3 | 12022011000112202110 |
4 | 1322123200032033 |
5 | 13201312431343 |
6 | 535452555103 |
7 | 101620653210 |
oct | 17233401617 |
9 | 5264015673 |
10 | 2054030223 |
11 | 9644a0343 |
12 | 493a82a93 |
13 | 269713ccb |
14 | 156b21407 |
15 | c04d6833 |
hex | 7a6e038f |
2054030223 has 16 divisors (see below), whose sum is σ = 3160342016. Its totient is φ = 1162334880.
The previous prime is 2054030197. The next prime is 2054030239. The reversal of 2054030223 is 3220304502.
It is not a de Polignac number, because 2054030223 - 26 = 2054030159 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 2054030223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2054032223) 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 15 ways as a sum of consecutive naturals, for example, 472648 + ... + 476973.
It is an arithmetic number, because the mean of its divisors is an integer number (197521376).
Almost surely, 22054030223 is an apocalyptic number.
2054030223 is a deficient number, since it is larger than the sum of its proper divisors (1106311793).
2054030223 is a wasteful number, since it uses less digits than its factorization.
2054030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949734.
The product of its (nonzero) digits is 1440, while the sum is 21.
The square root of 2054030223 is about 45321.4102053323. The cubic root of 2054030223 is about 1271.1660241989.
Adding to 2054030223 its reverse (3220304502), we get a palindrome (5274334725).
The spelling of 2054030223 in words is "two billion, fifty-four million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •