Base | Representation |
---|---|
bin | 111110010110001101010… |
… | …011110010000100101001 |
3 | 120011120220220111210200111 |
4 | 332112031103302010221 |
5 | 1030144030002324101 |
6 | 13040130044334321 |
7 | 621353513016061 |
oct | 76261523620451 |
9 | 16146826453614 |
10 | 4284453167401 |
11 | 1402032132490 |
12 | 5924328443a1 |
13 | 251039a096c4 |
14 | 10b5237943a1 |
15 | 766ad83a251 |
hex | 3e58d4f2129 |
4284453167401 has 8 divisors (see below), whose sum is σ = 4677289848000. Its totient is φ = 3892173309840.
The previous prime is 4284453167399. The next prime is 4284453167429. The reversal of 4284453167401 is 1047613544824.
4284453167401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4284453167401 - 21 = 4284453167399 is a prime.
It is a super-2 number, since 2×42844531674012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4284453167441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139189666 + ... + 139220443.
It is an arithmetic number, because the mean of its divisors is an integer number (584661231000).
Almost surely, 24284453167401 is an apocalyptic number.
It is an amenable number.
4284453167401 is a deficient number, since it is larger than the sum of its proper divisors (392836680599).
4284453167401 is a wasteful number, since it uses less digits than its factorization.
4284453167401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278411519.
The product of its (nonzero) digits is 2580480, while the sum is 49.
The spelling of 4284453167401 in words is "four trillion, two hundred eighty-four billion, four hundred fifty-three million, one hundred sixty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.363 sec. • engine limits •