Base | Representation |
---|---|
bin | 1111110110111101… |
… | …0100110100110000 |
3 | 101222200101010101120 |
4 | 3331233110310300 |
5 | 32204300313322 |
6 | 1542231102240 |
7 | 210331154220 |
oct | 37557246460 |
9 | 11880333346 |
10 | 4257041712 |
11 | 1894a974a0 |
12 | 9a9811980 |
13 | 52ac5b2c1 |
14 | 2c5544080 |
15 | 19daeaa5c |
hex | fdbd4d30 |
4257041712 has 160 divisors (see below), whose sum is σ = 13916442624. Its totient is φ = 1089158400.
The previous prime is 4257041699. The next prime is 4257041749. The reversal of 4257041712 is 2171407524.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 239037 + ... + 256227.
Almost surely, 24257041712 is an apocalyptic number.
4257041712 is a gapful number since it is divisible by the number (42) 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 4257041712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6958221312).
4257041712 is an abundant number, since it is smaller than the sum of its proper divisors (9659400912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4257041712 is a wasteful number, since it uses less digits than its factorization.
4257041712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17287 (or 17281 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 33.
The square root of 4257041712 is about 65246.0091653122. The cubic root of 4257041712 is about 1620.7000114539.
The spelling of 4257041712 in words is "four billion, two hundred fifty-seven million, forty-one thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •