Base | Representation |
---|---|
bin | 1010001010010110… |
… | …01000101000100110 |
3 | 112002012111211111122 |
4 | 11011023020220212 |
5 | 42133102423100 |
6 | 2301202333542 |
7 | 252123051032 |
oct | 50513105046 |
9 | 15065454448 |
10 | 5455514150 |
11 | 234a54a589 |
12 | 108305a2b2 |
13 | 68c3393a8 |
14 | 39a7971c2 |
15 | 21de33985 |
hex | 1452c8a26 |
5455514150 has 12 divisors (see below), whose sum is σ = 10147256412. Its totient is φ = 2182205640.
The previous prime is 5455514131. The next prime is 5455514153. The reversal of 5455514150 is 514155545.
It is a self number, because there is not a number n which added to its sum of digits gives 5455514150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5455514153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 54555092 + ... + 54555191.
It is an arithmetic number, because the mean of its divisors is an integer number (845604701).
Almost surely, 25455514150 is an apocalyptic number.
5455514150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5455514150 is a deficient number, since it is larger than the sum of its proper divisors (4691742262).
5455514150 is a wasteful number, since it uses less digits than its factorization.
5455514150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109110295 (or 109110290 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 35.
The square root of 5455514150 is about 73861.4523956847. The cubic root of 5455514150 is about 1760.4021711367.
Adding to 5455514150 its reverse (514155545), we get a palindrome (5969669695).
The spelling of 5455514150 in words is "five billion, four hundred fifty-five million, five hundred fourteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •