Base | Representation |
---|---|
bin | 101110110000011111010… |
… | …1001100100000110001000 |
3 | 211202100110102220002110022 |
4 | 1131200332221210012020 |
5 | 1320242101433023320 |
6 | 21400113414240012 |
7 | 1232200153031405 |
oct | 135407651440610 |
9 | 24670412802408 |
10 | 6426322157960 |
11 | 205842a362701 |
12 | 87956a356008 |
13 | 377ccc0ca023 |
14 | 18306db872ac |
15 | b226b66e325 |
hex | 5d83ea64188 |
6426322157960 has 96 divisors (see below), whose sum is σ = 14791445588160. Its totient is φ = 2512766062464.
The previous prime is 6426322157933. The next prime is 6426322157971. The reversal of 6426322157960 is 697512236246.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73029749 + ... + 73117691.
It is an arithmetic number, because the mean of its divisors is an integer number (154077558210).
Almost surely, 26426322157960 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6426322157960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7395722794080).
6426322157960 is an abundant number, since it is smaller than the sum of its proper divisors (8365123430200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6426322157960 is a wasteful number, since it uses less digits than its factorization.
6426322157960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88875 (or 88824 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 53.
The spelling of 6426322157960 in words is "six trillion, four hundred twenty-six billion, three hundred twenty-two million, one hundred fifty-seven thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •