Base | Representation |
---|---|
bin | 111101110110011000110… |
… | …011101001000000000111 |
3 | 120001022201202120121210011 |
4 | 331312120303221000013 |
5 | 1024114041300023423 |
6 | 13012315442411051 |
7 | 616034025465610 |
oct | 75663063510007 |
9 | 16038652517704 |
10 | 4250286329863 |
11 | 1399599912772 |
12 | 587898360a87 |
13 | 24aa532aa182 |
14 | 109a01ba6c07 |
15 | 7585ded2b0d |
hex | 3dd98ce9007 |
4250286329863 has 8 divisors (see below), whose sum is σ = 4857492182400. Its totient is φ = 3643086000120.
The previous prime is 4250286329851. The next prime is 4250286329873. The reversal of 4250286329863 is 3689236820524.
4250286329863 is digitally balanced in base 2 and base 3, because in such bases 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 not a de Polignac number, because 4250286329863 - 229 = 4249749458951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4250286329798 and 4250286329807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4250286329813) 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, 426048 + ... + 2946538.
It is an arithmetic number, because the mean of its divisors is an integer number (607186522800).
Almost surely, 24250286329863 is an apocalyptic number.
4250286329863 is a deficient number, since it is larger than the sum of its proper divisors (607205852537).
4250286329863 is a wasteful number, since it uses less digits than its factorization.
4250286329863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2761397.
The product of its (nonzero) digits is 29859840, while the sum is 58.
The spelling of 4250286329863 in words is "four trillion, two hundred fifty billion, two hundred eighty-six million, three hundred twenty-nine thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •