Base | Representation |
---|---|
bin | 101000011000011111010… |
… | …1110100101010101111001 |
3 | 201122120220111200012001100 |
4 | 1100300332232211111321 |
5 | 1211413201414123101 |
6 | 15445412003242013 |
7 | 1111661615561121 |
oct | 120607656452571 |
9 | 21576814605040 |
10 | 5550150145401 |
11 | 184a895079514 |
12 | 7577a6079309 |
13 | 3134b9101b94 |
14 | 1528b3221c81 |
15 | 9958aea6e86 |
hex | 50c3eba5579 |
5550150145401 has 12 divisors (see below), whose sum is σ = 8365443697728. Its totient is φ = 3539226179544.
The previous prime is 5550150145399. The next prime is 5550150145511. The reversal of 5550150145401 is 1045410510555.
5550150145401 is a `hidden beast` number, since 5 + 5 + 50 + 1 + 50 + 14 + 540 + 1 = 666.
It is not a de Polignac number, because 5550150145401 - 21 = 5550150145399 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5550150145801) 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 11 ways as a sum of consecutive naturals, for example, 13406159565 + ... + 13406159978.
It is an arithmetic number, because the mean of its divisors is an integer number (697120308144).
Almost surely, 25550150145401 is an apocalyptic number.
It is an amenable number.
5550150145401 is a deficient number, since it is larger than the sum of its proper divisors (2815293552327).
5550150145401 is a wasteful number, since it uses less digits than its factorization.
5550150145401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26812319572 (or 26812319569 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 36.
Adding to 5550150145401 its reverse (1045410510555), we get a palindrome (6595560655956).
The spelling of 5550150145401 in words is "five trillion, five hundred fifty billion, one hundred fifty million, one hundred forty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •