Base | Representation |
---|---|
bin | 1011111101110111… |
… | …11001111100111101 |
3 | 121120202000111220021 |
4 | 11332323321330331 |
5 | 101124144203011 |
6 | 2541301252141 |
7 | 315131126233 |
oct | 57673717475 |
9 | 17522014807 |
10 | 6424600381 |
11 | 27a75793a1 |
12 | 12b3704051 |
13 | 7b50416b4 |
14 | 44d378953 |
15 | 27905a471 |
hex | 17eef9f3d |
6424600381 has 8 divisors (see below), whose sum is σ = 6484183200. Its totient is φ = 6365177520.
The previous prime is 6424600379. The next prime is 6424600393. The reversal of 6424600381 is 1830064246.
6424600381 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6424600381 - 21 = 6424600379 is a prime.
It is a super-2 number, since 2×64246003812 = 82550980111090690322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6424600361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41475 + ... + 120703.
It is an arithmetic number, because the mean of its divisors is an integer number (810522900).
Almost surely, 26424600381 is an apocalyptic number.
It is an amenable number.
6424600381 is a deficient number, since it is larger than the sum of its proper divisors (59582819).
6424600381 is a wasteful number, since it uses less digits than its factorization.
6424600381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79979.
The product of its (nonzero) digits is 27648, while the sum is 34.
The square root of 6424600381 is about 80153.6049158115. The cubic root of 6424600381 is about 1859.0113431069.
The spelling of 6424600381 in words is "six billion, four hundred twenty-four million, six hundred thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •