Base | Representation |
---|---|
bin | 10011100010100001… |
… | …01101010101110110 |
3 | 1000002002001022211112 |
4 | 21301100231111312 |
5 | 132440433440042 |
6 | 4452532035022 |
7 | 520645501415 |
oct | 116120552566 |
9 | 30062038745 |
10 | 10490140022 |
11 | 44a345750a |
12 | 2049162a72 |
13 | cb23cc65b |
14 | 7172ad47c |
15 | 415e29982 |
hex | 27142d576 |
10490140022 has 8 divisors (see below), whose sum is σ = 15743493072. Its totient is φ = 5242309000.
The previous prime is 10490139991. The next prime is 10490140039. The reversal of 10490140022 is 22004109401.
10490140022 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×104901400222 (a number of 21 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 10490140022.
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, 1375754 + ... + 1383357.
It is an arithmetic number, because the mean of its divisors is an integer number (1967936634).
Almost surely, 210490140022 is an apocalyptic number.
10490140022 is a deficient number, since it is larger than the sum of its proper divisors (5253353050).
10490140022 is a wasteful number, since it uses less digits than its factorization.
10490140022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2761014.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10490140022 its reverse (22004109401), we get a palindrome (32494249423).
The spelling of 10490140022 in words is "ten billion, four hundred ninety million, one hundred forty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •