Base | Representation |
---|---|
bin | 1001101011100001000101… |
… | …1110101100000011111110 |
3 | 1101200111000110022102111220 |
4 | 2122320101132230003332 |
5 | 2343334304341420313 |
6 | 34345232341254210 |
7 | 2145642653104542 |
oct | 232702136540376 |
9 | 41614013272456 |
10 | 10643222216958 |
11 | 3433846522981 |
12 | 123a889704366 |
13 | 5c28615b5326 |
14 | 28b1c58ada22 |
15 | 136cc45d3823 |
hex | 9ae117ac0fe |
10643222216958 has 16 divisors (see below), whose sum is σ = 21288035390736. Its totient is φ = 3547475579520.
The previous prime is 10643222216947. The next prime is 10643222216959. The reversal of 10643222216958 is 85961222234601.
It is a super-2 number, since 2×106432222169582 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10643222216958.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10643222216959) 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 7 ways as a sum of consecutive naturals, for example, 66202891 + ... + 66363462.
It is an arithmetic number, because the mean of its divisors is an integer number (1330502211921).
Almost surely, 210643222216958 is an apocalyptic number.
10643222216958 is an abundant number, since it is smaller than the sum of its proper divisors (10644813173778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643222216958 is a wasteful number, since it uses less digits than its factorization.
10643222216958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132579739.
The product of its (nonzero) digits is 2488320, while the sum is 51.
The spelling of 10643222216958 in words is "ten trillion, six hundred forty-three billion, two hundred twenty-two million, two hundred sixteen thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •