Base | Representation |
---|---|
bin | 1001100110100101… |
… | …01011010000001001 |
3 | 111022021222120220220 |
4 | 10303102223100021 |
5 | 41024302013230 |
6 | 2211324140253 |
7 | 241521015231 |
oct | 46322532011 |
9 | 14267876826 |
10 | 5155501065 |
11 | 2206167290 |
12 | bba697689 |
13 | 642135660 |
14 | 36c9bccc1 |
15 | 202920d10 |
hex | 1334ab409 |
5155501065 has 128 divisors (see below), whose sum is σ = 9993715200. Its totient is φ = 2236416000.
The previous prime is 5155501051. The next prime is 5155501069. The reversal of 5155501065 is 5601055515.
It is not a de Polignac number, because 5155501065 - 211 = 5155499017 is a prime.
It is a super-2 number, since 2×51555010652 = 53158382462432268450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (5155501069) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 11481961 + ... + 11482409.
It is an arithmetic number, because the mean of its divisors is an integer number (78075900).
Almost surely, 25155501065 is an apocalyptic number.
5155501065 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5155501065 is a deficient number, since it is larger than the sum of its proper divisors (4838214135).
5155501065 is a wasteful number, since it uses less digits than its factorization.
5155501065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 635.
The product of its (nonzero) digits is 18750, while the sum is 33.
The square root of 5155501065 is about 71801.8179783771. The cubic root of 5155501065 is about 1727.5221596900.
It can be divided in two parts, 515550 and 1065, that added together give a palindrome (516615).
The spelling of 5155501065 in words is "five billion, one hundred fifty-five million, five hundred one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •