Base | Representation |
---|---|
bin | 11100101100110100000001… |
… | …10010101010011101110110 |
3 | 22021110111011101022020101110 |
4 | 32112122000302222131312 |
5 | 31233013204003242324 |
6 | 342121235130535450 |
7 | 16202502234301656 |
oct | 1626320062523566 |
9 | 267414141266343 |
10 | 63112410212214 |
11 | 19122906256010 |
12 | 70b3736597586 |
13 | 292a62302b25c |
14 | 118292a970366 |
15 | 746a72cd1329 |
hex | 396680caa776 |
63112410212214 has 32 divisors (see below), whose sum is σ = 142141733268480. Its totient is φ = 18508038184800.
The previous prime is 63112410212197. The next prime is 63112410212231. The reversal of 63112410212214 is 41221201421136.
63112410212214 is digitally balanced in base 2, 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 (63112410212197) and next prime (63112410212231).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15423363109 + ... + 15423367200.
It is an arithmetic number, because the mean of its divisors is an integer number (4441929164640).
Almost surely, 263112410212214 is an apocalyptic number.
63112410212214 is an abundant number, since it is smaller than the sum of its proper divisors (79029323056266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63112410212214 is a wasteful number, since it uses less digits than its factorization.
63112410212214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30846730356.
The product of its (nonzero) digits is 4608, while the sum is 30.
The spelling of 63112410212214 in words is "sixty-three trillion, one hundred twelve billion, four hundred ten million, two hundred twelve thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •