Base | Representation |
---|---|
bin | 10111100001110011… |
… | …10100001000101110 |
3 | 1012121022121220002220 |
4 | 23300321310020232 |
5 | 201332143402230 |
6 | 5445231300210 |
7 | 625011005565 |
oct | 136071641056 |
9 | 35538556086 |
10 | 12631622190 |
11 | 53a2248790 |
12 | 254637a666 |
13 | 1263c82875 |
14 | 87b876bdc |
15 | 4dde37d10 |
hex | 2f0e7422e |
12631622190 has 32 divisors (see below), whose sum is σ = 33071884416. Its totient is φ = 3062211360.
The previous prime is 12631622189. The next prime is 12631622209. The reversal of 12631622190 is 9122613621.
12631622190 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×126316221902 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 15 ways as a sum of consecutive naturals, for example, 19138492 + ... + 19139151.
It is an arithmetic number, because the mean of its divisors is an integer number (1033496388).
Almost surely, 212631622190 is an apocalyptic number.
12631622190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12631622190 is an abundant number, since it is smaller than the sum of its proper divisors (20440262226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12631622190 is a wasteful number, since it uses less digits than its factorization.
12631622190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38277664.
The product of its (nonzero) digits is 7776, while the sum is 33.
The spelling of 12631622190 in words is "twelve billion, six hundred thirty-one million, six hundred twenty-two thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •