Base | Representation |
---|---|
bin | 101000011000011111011… |
… | …1110101000101010110011 |
3 | 201122120220210120222020121 |
4 | 1100300332332220222303 |
5 | 1211413204003301311 |
6 | 15445412233351111 |
7 | 1111661666415130 |
oct | 120607676505263 |
9 | 21576823528217 |
10 | 5550154353331 |
11 | 184a897492a45 |
12 | 7577a7568497 |
13 | 3134b9c46293 |
14 | 1528b39d9587 |
15 | 9958b538b71 |
hex | 50c3efa8ab3 |
5550154353331 has 16 divisors (see below), whose sum is σ = 6778920969216. Its totient is φ = 4435590243456.
The previous prime is 5550154353301. The next prime is 5550154353383. The reversal of 5550154353331 is 1333534510555.
It is a cyclic number.
It is not a de Polignac number, because 5550154353331 - 219 = 5550153829043 is a prime.
It is a super-2 number, since 2×55501543533312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5550154353301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217930971 + ... + 217956436.
It is an arithmetic number, because the mean of its divisors is an integer number (423682560576).
Almost surely, 25550154353331 is an apocalyptic number.
5550154353331 is a deficient number, since it is larger than the sum of its proper divisors (1228766615885).
5550154353331 is a wasteful number, since it uses less digits than its factorization.
5550154353331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435887538.
The product of its (nonzero) digits is 1012500, while the sum is 43.
Adding to 5550154353331 its reverse (1333534510555), we get a palindrome (6883688863886).
The spelling of 5550154353331 in words is "five trillion, five hundred fifty billion, one hundred fifty-four million, three hundred fifty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •