Base | Representation |
---|---|
bin | 1001010101011000111000… |
… | …0111101101100110101100 |
3 | 1100100010202101101200200211 |
4 | 2111112032013231212230 |
5 | 2321122222140202440 |
6 | 33454441340432204 |
7 | 2106324140211364 |
oct | 225261607554654 |
9 | 40303671350624 |
10 | 10263061256620 |
11 | 32a75a3581727 |
12 | 1199072548664 |
13 | 595a581b6013 |
14 | 276a404939a4 |
15 | 12be7475deea |
hex | 9558e1ed9ac |
10263061256620 has 96 divisors (see below), whose sum is σ = 22073525913600. Its totient is φ = 4006478371584.
The previous prime is 10263061256521. The next prime is 10263061256621. The reversal of 10263061256620 is 2665216036201.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (10263061256621) 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, 585147811 + ... + 585165349.
It is an arithmetic number, because the mean of its divisors is an integer number (229932561600).
Almost surely, 210263061256620 is an apocalyptic number.
10263061256620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10263061256620 is an abundant number, since it is smaller than the sum of its proper divisors (11810464656980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10263061256620 is a wasteful number, since it uses less digits than its factorization.
10263061256620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19327 (or 19325 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 10263061256620 in words is "ten trillion, two hundred sixty-three billion, sixty-one million, two hundred fifty-six thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •