Base | Representation |
---|---|
bin | 1111011101100011… |
… | …1110100011110111 |
3 | 101201020221021011000 |
4 | 3313120332203313 |
5 | 32000013120210 |
6 | 1523504014343 |
7 | 204565560363 |
oct | 36730764367 |
9 | 11636837130 |
10 | 4150520055 |
11 | 183a951170 |
12 | 97a0013b3 |
13 | 511b73236 |
14 | 2b53362a3 |
15 | 1945a8ac0 |
hex | f763e8f7 |
4150520055 has 32 divisors (see below), whose sum is σ = 8049496320. Its totient is φ = 2012372640.
The previous prime is 4150520051. The next prime is 4150520117. The reversal of 4150520055 is 5500250514.
4150520055 is a `hidden beast` number, since 41 + 50 + 520 + 0 + 55 = 666.
It is not a de Polignac number, because 4150520055 - 22 = 4150520051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4150520051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1395997 + ... + 1398966.
It is an arithmetic number, because the mean of its divisors is an integer number (251546760).
Almost surely, 24150520055 is an apocalyptic number.
4150520055 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
4150520055 is a deficient number, since it is larger than the sum of its proper divisors (3898976265).
4150520055 is a wasteful number, since it uses less digits than its factorization.
4150520055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2794988 (or 2794982 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The square root of 4150520055 is about 64424.5299167949. The cubic root of 4150520055 is about 1607.0676992917.
Adding to 4150520055 its reverse (5500250514), we get a palindrome (9650770569).
The spelling of 4150520055 in words is "four billion, one hundred fifty million, five hundred twenty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •