Base | Representation |
---|---|
bin | 11001100100011… |
… | …000011100111010 |
3 | 1002220011211010000 |
4 | 121210120130322 |
5 | 1334303431423 |
6 | 110322133430 |
7 | 13426110543 |
oct | 3144303472 |
9 | 1086154100 |
10 | 428967738 |
11 | 2001608a1 |
12 | bb7b1276 |
13 | 6ab44784 |
14 | 40d854ca |
15 | 279d6843 |
hex | 1991873a |
428967738 has 80 divisors (see below), whose sum is σ = 990624096. Its totient is φ = 138684960.
The previous prime is 428967727. The next prime is 428967809. The reversal of 428967738 is 837769824.
It is a super-3 number, since 3×4289677383 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
Its product of digits (4064256) is a multiple of the sum of its prime divisors (672).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 819945 + ... + 820467.
Almost surely, 2428967738 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 428967738, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (495312048).
428967738 is an abundant number, since it is smaller than the sum of its proper divisors (561656358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
428967738 is a wasteful number, since it uses less digits than its factorization.
428967738 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681 (or 672 counting only the distinct ones).
The product of its digits is 4064256, while the sum is 54.
The square root of 428967738 is about 20711.5363505463. The cubic root of 428967738 is about 754.1797667935.
It can be divided in two parts, 4289 and 67738, that added together give a palindrome (72027).
The spelling of 428967738 in words is "four hundred twenty-eight million, nine hundred sixty-seven thousand, seven hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •