Base | Representation |
---|---|
bin | 1100011101001111010… |
… | …00111001000011111111 |
3 | 1111220210001101002022120 |
4 | 12032213220321003333 |
5 | 24003033123324423 |
6 | 524343235214023 |
7 | 42631410216405 |
oct | 6164750710377 |
9 | 1456701332276 |
10 | 428014276863 |
11 | 1555799a0228 |
12 | 6ab51147313 |
13 | 314914b7524 |
14 | 16a049cb475 |
15 | b20102eee3 |
hex | 63a7a390ff |
428014276863 has 8 divisors (see below), whose sum is σ = 579203399808. Its totient is φ = 281084002584.
The previous prime is 428014276861. The next prime is 428014276889. The reversal of 428014276863 is 368672410824.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 428014276863 - 21 = 428014276861 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (428014276861) by changing a digit.
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, 1064711931 + ... + 1064712332.
It is an arithmetic number, because the mean of its divisors is an integer number (72400424976).
Almost surely, 2428014276863 is an apocalyptic number.
428014276863 is a deficient number, since it is larger than the sum of its proper divisors (151189122945).
428014276863 is a wasteful number, since it uses less digits than its factorization.
428014276863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2129424333.
The product of its (nonzero) digits is 3096576, while the sum is 51.
The spelling of 428014276863 in words is "four hundred twenty-eight billion, fourteen million, two hundred seventy-six thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •