Base | Representation |
---|---|
bin | 1010010000001100… |
… | …01010001000011011 |
3 | 112012121202122222201 |
4 | 11020012022020123 |
5 | 42233130304321 |
6 | 2310113231031 |
7 | 253256554051 |
oct | 51006121033 |
9 | 15177678881 |
10 | 5504541211 |
11 | 2375196314 |
12 | 1097562477 |
13 | 6995439a0 |
14 | 3a30ba1d1 |
15 | 2233ba291 |
hex | 14818a21b |
5504541211 has 4 divisors (see below), whose sum is σ = 5927967472. Its totient is φ = 5081114952.
The previous prime is 5504541199. The next prime is 5504541247. The reversal of 5504541211 is 1121454055.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1121454055 = 5 ⋅224290811.
It is a cyclic number.
It is not a de Polignac number, because 5504541211 - 27 = 5504541083 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 5504541211.
It is not an unprimeable number, because it can be changed into a prime (5504541611) 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, 211713111 + ... + 211713136.
It is an arithmetic number, because the mean of its divisors is an integer number (1481991868).
Almost surely, 25504541211 is an apocalyptic number.
5504541211 is a deficient number, since it is larger than the sum of its proper divisors (423426261).
5504541211 is a wasteful number, since it uses less digits than its factorization.
5504541211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423426260.
The product of its (nonzero) digits is 4000, while the sum is 28.
The square root of 5504541211 is about 74192.5953919931. The cubic root of 5504541211 is about 1765.6598539144.
Adding to 5504541211 its reverse (1121454055), we get a palindrome (6625995266).
The spelling of 5504541211 in words is "five billion, five hundred four million, five hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •