Base | Representation |
---|---|
bin | 1110101000110011010… |
… | …1101111010010001000 |
3 | 220001002110001102202010 |
4 | 3222030311233102020 |
5 | 13110003034010322 |
6 | 311305120135520 |
7 | 24111454144401 |
oct | 3521465572210 |
9 | 801073042663 |
10 | 251471000712 |
11 | 97714907918 |
12 | 408a11675a0 |
13 | 1a937a69809 |
14 | c257d269a8 |
15 | 681c03620c |
hex | 3a8cd6f488 |
251471000712 has 32 divisors (see below), whose sum is σ = 630997361280. Its totient is φ = 83514352320.
The previous prime is 251471000689. The next prime is 251471000731. The reversal of 251471000712 is 217000174152.
251471000712 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 251471000712.
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 7 ways as a sum of consecutive naturals, for example, 19325523 + ... + 19338530.
It is an arithmetic number, because the mean of its divisors is an integer number (19718667540).
Almost surely, 2251471000712 is an apocalyptic number.
It is an amenable number.
251471000712 is an abundant number, since it is smaller than the sum of its proper divisors (379526360568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251471000712 is a wasteful number, since it uses less digits than its factorization.
251471000712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38664333 (or 38664329 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 30.
Adding to 251471000712 its reverse (217000174152), we get a palindrome (468471174864).
The spelling of 251471000712 in words is "two hundred fifty-one billion, four hundred seventy-one million, seven hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •