Base | Representation |
---|---|
bin | 101110001010101111001… |
… | …0001110011110101110000 |
3 | 211110121012021100122101020 |
4 | 1130111132101303311300 |
5 | 1312430032044021110 |
6 | 21254544502535440 |
7 | 1223300112456114 |
oct | 134253621636560 |
9 | 24417167318336 |
10 | 6345248423280 |
11 | 2027006350898 |
12 | 865902a37580 |
13 | 37047b6ac660 |
14 | 17d17c589744 |
15 | b00c3ca6d70 |
hex | 5c55e473d70 |
6345248423280 has 160 divisors (see below), whose sum is σ = 21218272610304. Its totient is φ = 1559333680128.
The previous prime is 6345248423237. The next prime is 6345248423309. The reversal of 6345248423280 is 823248425436.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 218607 + ... + 3569073.
Almost surely, 26345248423280 is an apocalyptic number.
6345248423280 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6345248423280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10609136305152).
6345248423280 is an abundant number, since it is smaller than the sum of its proper divisors (14873024187024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6345248423280 is a wasteful number, since it uses less digits than its factorization.
6345248423280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3351103 (or 3351097 counting only the distinct ones).
The product of its (nonzero) digits is 8847360, while the sum is 51.
The spelling of 6345248423280 in words is "six trillion, three hundred forty-five billion, two hundred forty-eight million, four hundred twenty-three thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •