Base | Representation |
---|---|
bin | 1011010011110101… |
… | …11000001010111101 |
3 | 120200011120001000020 |
4 | 11221322320022331 |
5 | 44413413300110 |
6 | 2442304122353 |
7 | 303320141220 |
oct | 55172701275 |
9 | 16604501006 |
10 | 6072009405 |
11 | 26365445a0 |
12 | 12156063b9 |
13 | 759c8c097 |
14 | 4185d55b7 |
15 | 25810dd70 |
hex | 169eb82bd |
6072009405 has 64 divisors (see below), whose sum is σ = 12232636416. Its totient is φ = 2498400000.
The previous prime is 6072009373. The next prime is 6072009421. The reversal of 6072009405 is 5049002706.
It is not a de Polignac number, because 6072009405 - 25 = 6072009373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 90630 + ... + 142680.
It is an arithmetic number, because the mean of its divisors is an integer number (191134944).
Almost surely, 26072009405 is an apocalyptic number.
It is an amenable number.
6072009405 is an abundant number, since it is smaller than the sum of its proper divisors (6160627011).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6072009405 is a wasteful number, since it uses less digits than its factorization.
6072009405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52178.
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 6072009405 is about 77923.0993030950. The cubic root of 6072009405 is about 1824.3611354877.
Adding to 6072009405 its reverse (5049002706), we get a palindrome (11121012111).
It can be divided in two parts, 607200 and 9405, that added together give a triangular number (616605 = T1110).
The spelling of 6072009405 in words is "six billion, seventy-two million, nine thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •