Base | Representation |
---|---|
bin | 101110101001011010100… |
… | …0101010011011111110000 |
3 | 211200220020121210112101120 |
4 | 1131102311011103133300 |
5 | 1320014443043203204 |
6 | 21345122050102240 |
7 | 1231121521445211 |
oct | 135226505233760 |
9 | 24626217715346 |
10 | 6411129272304 |
11 | 2051a43377859 |
12 | 87662a27a980 |
13 | 37674a617c63 |
14 | 18242c0b3408 |
15 | b1b7c9586d9 |
hex | 5d4b51537f0 |
6411129272304 has 40 divisors (see below), whose sum is σ = 17536324188240. Its totient is φ = 2011334673408.
The previous prime is 6411129272257. The next prime is 6411129272351. The reversal of 6411129272304 is 4032729211146.
It is an interprime number because it is at equal distance from previous prime (6411129272257) and next prime (6411129272351).
It is a super-2 number, since 2×64111292723042 (a number of 26 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 3928387219 + ... + 3928388850.
It is an arithmetic number, because the mean of its divisors is an integer number (438408104706).
Almost surely, 26411129272304 is an apocalyptic number.
It is an amenable number.
6411129272304 is an abundant number, since it is smaller than the sum of its proper divisors (11125194915936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6411129272304 is a wasteful number, since it uses less digits than its factorization.
6411129272304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7856776097 (or 7856776091 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 42.
The spelling of 6411129272304 in words is "six trillion, four hundred eleven billion, one hundred twenty-nine million, two hundred seventy-two thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •