Base | Representation |
---|---|
bin | 11100110000110101101000… |
… | …00111101110101100010010 |
3 | 22021221201010202100221200020 |
4 | 32120122310013232230102 |
5 | 31242244423320413114 |
6 | 342304550350204310 |
7 | 16215466365001620 |
oct | 1630326407565422 |
9 | 267851122327606 |
10 | 63250710326034 |
11 | 19176526044540 |
12 | 71164b2ab3696 |
13 | 293a69368372a |
14 | 11894ca506510 |
15 | 74a469672aa9 |
hex | 3986b41eeb12 |
63250710326034 has 64 divisors (see below), whose sum is σ = 159876550932480. Its totient is φ = 16203704469120.
The previous prime is 63250710326033. The next prime is 63250710326047. The reversal of 63250710326034 is 43062301705236.
63250710326034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (63250710326033) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 937680654 + ... + 937748105.
It is an arithmetic number, because the mean of its divisors is an integer number (2498071108320).
Almost surely, 263250710326034 is an apocalyptic number.
63250710326034 is an abundant number, since it is smaller than the sum of its proper divisors (96625840606446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63250710326034 is a wasteful number, since it uses less digits than its factorization.
63250710326034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1875428855.
The product of its (nonzero) digits is 544320, while the sum is 42.
The spelling of 63250710326034 in words is "sixty-three trillion, two hundred fifty billion, seven hundred ten million, three hundred twenty-six thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •