Base | Representation |
---|---|
bin | 1010001111101101… |
… | …11001010100110110 |
3 | 112012100020101122122 |
4 | 11013312321110312 |
5 | 42231114241324 |
6 | 2305451355542 |
7 | 253210551251 |
oct | 50766712466 |
9 | 15170211578 |
10 | 5500540214 |
11 | 2372a03304 |
12 | 1096152bb2 |
13 | 698772830 |
14 | 3a2758098 |
15 | 222d79a5e |
hex | 147db9536 |
5500540214 has 8 divisors (see below), whose sum is σ = 8885488080. Its totient is φ = 2538710856.
The previous prime is 5500540207. The next prime is 5500540217. The reversal of 5500540214 is 4120450055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 211559239 = 5500540214 / (5 + 5 + 0 + 0 + 5 + 4 + 0 + 2 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5500540217) 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 3 ways as a sum of consecutive naturals, for example, 105779594 + ... + 105779645.
It is an arithmetic number, because the mean of its divisors is an integer number (1110686010).
Almost surely, 25500540214 is an apocalyptic number.
5500540214 is a deficient number, since it is larger than the sum of its proper divisors (3384947866).
5500540214 is a wasteful number, since it uses less digits than its factorization.
5500540214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211559254.
The product of its (nonzero) digits is 4000, while the sum is 26.
The square root of 5500540214 is about 74165.6269035731. The cubic root of 5500540214 is about 1765.2319580012.
Adding to 5500540214 its reverse (4120450055), we get a palindrome (9620990269).
The spelling of 5500540214 in words is "five billion, five hundred million, five hundred forty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •