Base | Representation |
---|---|
bin | 1010101010101001… |
… | …00000100010111000 |
3 | 112210002020121102020 |
4 | 11111110200202320 |
5 | 43211430004330 |
6 | 2344120434440 |
7 | 261622440450 |
oct | 52524404270 |
9 | 15702217366 |
10 | 5726406840 |
11 | 2479453240 |
12 | 1139918a20 |
13 | 7034b561b |
14 | 3c4750d60 |
15 | 237ae3210 |
hex | 1555208b8 |
5726406840 has 128 divisors (see below), whose sum is σ = 21418283520. Its totient is φ = 1189900800.
The previous prime is 5726406823. The next prime is 5726406911. The reversal of 5726406840 is 486046275.
It is a super-3 number, since 3×57264068403 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 5726406792 and 5726406801.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 300631 + ... + 319110.
It is an arithmetic number, because the mean of its divisors is an integer number (167330340).
Almost surely, 25726406840 is an apocalyptic number.
It is an amenable number.
5726406840 is an abundant number, since it is smaller than the sum of its proper divisors (15691876680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5726406840 is a wasteful number, since it uses less digits than its factorization.
5726406840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619773 (or 619769 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 42.
The square root of 5726406840 is about 75673.0258414450. The cubic root of 5726406840 is about 1789.0702744433.
The spelling of 5726406840 in words is "five billion, seven hundred twenty-six million, four hundred six thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •