Base | Representation |
---|---|
bin | 100100100101101010001… |
… | …1001011000110111000111 |
3 | 122210201220000111021002022 |
4 | 1021023110121120313013 |
5 | 1124342211320132133 |
6 | 14410050320433355 |
7 | 1026211154420165 |
oct | 111132431306707 |
9 | 18721800437068 |
10 | 5028675161543 |
11 | 1669716038880 |
12 | 69271117885b |
13 | 2a6281b35887 |
14 | 135563c86235 |
15 | 8ac19da0998 |
hex | 492d4658dc7 |
5028675161543 has 32 divisors (see below), whose sum is σ = 5532582362112. Its totient is φ = 4532698684800.
The previous prime is 5028675161513. The next prime is 5028675161557. The reversal of 5028675161543 is 3451615768205.
It is a happy number.
It is not a de Polignac number, because 5028675161543 - 220 = 5028674112967 is a prime.
It is a super-2 number, since 2×50286751615432 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5028675161513) 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, 2687692898 + ... + 2687694768.
It is an arithmetic number, because the mean of its divisors is an integer number (172893198816).
Almost surely, 25028675161543 is an apocalyptic number.
5028675161543 is a deficient number, since it is larger than the sum of its proper divisors (503907200569).
5028675161543 is a wasteful number, since it uses less digits than its factorization.
5028675161543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4535.
The product of its (nonzero) digits is 6048000, while the sum is 53.
The spelling of 5028675161543 in words is "five trillion, twenty-eight billion, six hundred seventy-five million, one hundred sixty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •