Base | Representation |
---|---|
bin | 1001011001100101… |
… | …11011111111111011 |
3 | 111000200220122221000 |
4 | 10230302323333323 |
5 | 40313402032010 |
6 | 2152432220043 |
7 | 236025456516 |
oct | 45462737773 |
9 | 14020818830 |
10 | 5046517755 |
11 | 215a69a534 |
12 | b8a09a623 |
13 | 625697ca6 |
14 | 35c32dd7d |
15 | 1e80947c0 |
hex | 12ccbbffb |
5046517755 has 32 divisors (see below), whose sum is σ = 8984102400. Its totient is φ = 2687721696.
The previous prime is 5046517753. The next prime is 5046517771. The reversal of 5046517755 is 5577156405.
5046517755 is a `hidden beast` number, since 504 + 65 + 17 + 75 + 5 = 666.
It is not a de Polignac number, because 5046517755 - 21 = 5046517753 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5046517755.
It is not an unprimeable number, because it can be changed into a prime (5046517753) 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 31 ways as a sum of consecutive naturals, for example, 72436 + ... + 123854.
It is an arithmetic number, because the mean of its divisors is an integer number (280753200).
Almost surely, 25046517755 is an apocalyptic number.
5046517755 is a deficient number, since it is larger than the sum of its proper divisors (3937584645).
5046517755 is a wasteful number, since it uses less digits than its factorization.
5046517755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52160 (or 52154 counting only the distinct ones).
The product of its (nonzero) digits is 735000, while the sum is 45.
The square root of 5046517755 is about 71038.8468022954. The cubic root of 5046517755 is about 1715.2625352094.
The spelling of 5046517755 in words is "five billion, forty-six million, five hundred seventeen thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •