Base | Representation |
---|---|
bin | 1000000001010100… |
… | …1111111101100011 |
3 | 12120001100110220122 |
4 | 2000111033331203 |
5 | 13402140212201 |
6 | 553351230455 |
7 | 104232441341 |
oct | 20025177543 |
9 | 5501313818 |
10 | 2153054051 |
11 | a05385415 |
12 | 50107842b |
13 | 2840a53a5 |
14 | 165d3a991 |
15 | c9046e1b |
hex | 8054ff63 |
2153054051 has 4 divisors (see below), whose sum is σ = 2168769912. Its totient is φ = 2137338192.
The previous prime is 2153054021. The next prime is 2153054069. The reversal of 2153054051 is 1504503512.
2153054051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2153054051 - 210 = 2153053027 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 2153054051.
It is not an unprimeable number, because it can be changed into a prime (2153054021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7857725 + ... + 7857998.
It is an arithmetic number, because the mean of its divisors is an integer number (542192478).
Almost surely, 22153054051 is an apocalyptic number.
2153054051 is a deficient number, since it is larger than the sum of its proper divisors (15715861).
2153054051 is a wasteful number, since it uses less digits than its factorization.
2153054051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15715860.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 2153054051 is about 46401.0134695353. The cubic root of 2153054051 is about 1291.2737156087.
Adding to 2153054051 its reverse (1504503512), we get a palindrome (3657557563).
The spelling of 2153054051 in words is "two billion, one hundred fifty-three million, fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •