Base | Representation |
---|---|
bin | 10100011110001010… |
… | …00001111100001010 |
3 | 1001100221100220212002 |
4 | 22033011001330022 |
5 | 140002020121041 |
6 | 5014322151002 |
7 | 536231550233 |
oct | 121705017412 |
9 | 31327326762 |
10 | 10990395146 |
11 | 472a8785a5 |
12 | 21687b2462 |
13 | 1061c438c3 |
14 | 7638d008a |
15 | 444ce359b |
hex | 28f141f0a |
10990395146 has 4 divisors (see below), whose sum is σ = 16485592722. Its totient is φ = 5495197572.
The previous prime is 10990395113. The next prime is 10990395151. The reversal of 10990395146 is 64159309901.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 10834519921 + 155875225 = 104089^2 + 12485^2 .
It is a super-2 number, since 2×109903951462 (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 10990395146.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2747598785 + ... + 2747598788.
Almost surely, 210990395146 is an apocalyptic number.
10990395146 is a deficient number, since it is larger than the sum of its proper divisors (5495197576).
10990395146 is an equidigital number, since it uses as much as digits as its factorization.
10990395146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5495197575.
The product of its (nonzero) digits is 262440, while the sum is 47.
The spelling of 10990395146 in words is "ten billion, nine hundred ninety million, three hundred ninety-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •