Base | Representation |
---|---|
bin | 1011011001000010… |
… | …01111010011101001 |
3 | 120210012121200121011 |
4 | 11230201033103221 |
5 | 100011044320243 |
6 | 2450502543521 |
7 | 304356625063 |
oct | 55441172351 |
9 | 16705550534 |
10 | 6115620073 |
11 | 2659120972 |
12 | 1228137ba1 |
13 | 76601b204 |
14 | 420308733 |
15 | 25bd7589d |
hex | 16c84f4e9 |
6115620073 has 6 divisors (see below), whose sum is σ = 6285375726. Its totient is φ = 5950331712.
The previous prime is 6115620067. The next prime is 6115620083. The reversal of 6115620073 is 3700265116.
It can be written as a sum of positive squares in 3 ways, for example, as 5073427984 + 1042192089 = 71228^2 + 32283^2 .
It is not a de Polignac number, because 6115620073 - 213 = 6115611881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6115620083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2232240 + ... + 2234977.
It is an arithmetic number, because the mean of its divisors is an integer number (1047562621).
Almost surely, 26115620073 is an apocalyptic number.
It is an amenable number.
6115620073 is a deficient number, since it is larger than the sum of its proper divisors (169755653).
6115620073 is an equidigital number, since it uses as much as digits as its factorization.
6115620073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4467291 (or 4467254 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 6115620073 is about 78202.4300965130. The cubic root of 6115620073 is about 1828.7183908806.
Adding to 6115620073 its reverse (3700265116), we get a palindrome (9815885189).
The spelling of 6115620073 in words is "six billion, one hundred fifteen million, six hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •