Base | Representation |
---|---|
bin | 10011101011000000… |
… | …11010100001111110 |
3 | 1000021001001222200222 |
4 | 21311200122201332 |
5 | 133112202204032 |
6 | 4503554421342 |
7 | 522502062635 |
oct | 116540324176 |
9 | 30231058628 |
10 | 10561366142 |
11 | 452a685778 |
12 | 2068b91852 |
13 | cc40aa2a2 |
14 | 72293051c |
15 | 41c2e8a12 |
hex | 27581a87e |
10561366142 has 8 divisors (see below), whose sum is σ = 15843099096. Its totient is φ = 5280333112.
The previous prime is 10561366139. The next prime is 10561366157. The reversal of 10561366142 is 24166316501.
10561366142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×105613661422 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135473 + ... + 198684.
It is an arithmetic number, because the mean of its divisors is an integer number (1980387387).
Almost surely, 210561366142 is an apocalyptic number.
10561366142 is a deficient number, since it is larger than the sum of its proper divisors (5281732954).
10561366142 is a wasteful number, since it uses less digits than its factorization.
10561366142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349962.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 10561366142 in words is "ten billion, five hundred sixty-one million, three hundred sixty-six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •