Base | Representation |
---|---|
bin | 11100101001111101010011… |
… | …10010111111100100010010 |
3 | 22021010002221212211002201221 |
4 | 32110332221302333210102 |
5 | 31224411303330313230 |
6 | 342004213130515254 |
7 | 16162430304452203 |
oct | 1624765162774422 |
9 | 267102855732657 |
10 | 63014313916690 |
11 | 190952474762a4 |
12 | 709871a295b2a |
13 | 29212bba4b586 |
14 | 117bca269d5aa |
15 | 744230c8727a |
hex | 394fa9cbf912 |
63014313916690 has 8 divisors (see below), whose sum is σ = 113425765050060. Its totient is φ = 25205725566672.
The previous prime is 63014313916669. The next prime is 63014313916711. The reversal of 63014313916690 is 9661931341036.
63014313916690 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (63014313916669) and next prime (63014313916711).
It can be written as a sum of positive squares in 2 ways, for example, as 62580266171361 + 434047745329 = 7910769^2 + 658823^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×630143139166902 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3150715695825 + ... + 3150715695844.
Almost surely, 263014313916690 is an apocalyptic number.
63014313916690 is a deficient number, since it is larger than the sum of its proper divisors (50411451133370).
63014313916690 is a wasteful number, since it uses less digits than its factorization.
63014313916690 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6301431391676.
The product of its (nonzero) digits is 1889568, while the sum is 52.
The spelling of 63014313916690 in words is "sixty-three trillion, fourteen billion, three hundred thirteen million, nine hundred sixteen thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •