Base | Representation |
---|---|
bin | 1010000101000110… |
… | …11111110010101100 |
3 | 111222010211011211112 |
4 | 11002203133302230 |
5 | 42040330200222 |
6 | 2252552411152 |
7 | 251050401356 |
oct | 50243376254 |
9 | 14863734745 |
10 | 5411568812 |
11 | 2327764821 |
12 | 10703a6ab8 |
13 | 6831c0b30 |
14 | 3949d80d6 |
15 | 21a152be2 |
hex | 1428dfcac |
5411568812 has 48 divisors (see below), whose sum is σ = 10297173600. Its totient is φ = 2473658880.
The previous prime is 5411568769. The next prime is 5411568817. The reversal of 5411568812 is 2188651145.
It is a super-2 number, since 2×54115688122 = 58570154014022182688, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5411568812.
It is not an unprimeable number, because it can be changed into a prime (5411568817) 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 15 ways as a sum of consecutive naturals, for example, 2614514 + ... + 2616582.
It is an arithmetic number, because the mean of its divisors is an integer number (214524450).
Almost surely, 25411568812 is an apocalyptic number.
5411568812 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5411568812 is a deficient number, since it is larger than the sum of its proper divisors (4885604788).
5411568812 is a wasteful number, since it uses less digits than its factorization.
5411568812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2546 (or 2544 counting only the distinct ones).
The product of its digits is 76800, while the sum is 41.
The square root of 5411568812 is about 73563.3659643168. The cubic root of 5411568812 is about 1755.6626163809.
The spelling of 5411568812 in words is "five billion, four hundred eleven million, five hundred sixty-eight thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •