Base | Representation |
---|---|
bin | 111010100100110111011… |
… | …001110011101111111111 |
3 | 112020211001001012110210102 |
4 | 322210313121303233333 |
5 | 1011422320322300144 |
6 | 12321111554031315 |
7 | 563551013225636 |
oct | 72446731635777 |
9 | 15224031173712 |
10 | 4025313868799 |
11 | 13121428149a3 |
12 | 55017157853b |
13 | 23277c377522 |
14 | dcb7d26a51d |
15 | 6ea934cab4e |
hex | 3a937673bff |
4025313868799 has 8 divisors (see below), whose sum is σ = 4056260695872. Its totient is φ = 3994471065600.
The previous prime is 4025313868727. The next prime is 4025313868841. The reversal of 4025313868799 is 9978683135204.
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 4025313868799 - 236 = 3956594392063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4025313861799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25928279 + ... + 26083064.
It is an arithmetic number, because the mean of its divisors is an integer number (507032586984).
It is a 1-persistent number, because it is pandigital, but 2⋅4025313868799 = 8050627737598 is not.
Almost surely, 24025313868799 is an apocalyptic number.
4025313868799 is a deficient number, since it is larger than the sum of its proper divisors (30946827073).
4025313868799 is a wasteful number, since it uses less digits than its factorization.
4025313868799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52011937.
The product of its (nonzero) digits is 78382080, while the sum is 65.
The spelling of 4025313868799 in words is "four trillion, twenty-five billion, three hundred thirteen million, eight hundred sixty-eight thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •