Base | Representation |
---|---|
bin | 110001011001110010… |
… | …0111001111111100010 |
3 | 101010211201211120221220 |
4 | 1202303210321333202 |
5 | 3214234023331430 |
6 | 120423223555510 |
7 | 10444026134643 |
oct | 1426344717742 |
9 | 333751746856 |
10 | 106092011490 |
11 | 40aa21a1543 |
12 | 18689bbbb96 |
13 | a009982b7a |
14 | 51c61816ca |
15 | 2b5de9a110 |
hex | 18b3939fe2 |
106092011490 has 32 divisors (see below), whose sum is σ = 254763282240. Its totient is φ = 28275374784.
The previous prime is 106092011489. The next prime is 106092011491. The reversal of 106092011490 is 94110290601.
It is an interprime number because it is at equal distance from previous prime (106092011489) and next prime (106092011491).
It is a super-2 number, since 2×1060920114902 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106092011491) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 934704 + ... + 1042043.
It is an arithmetic number, because the mean of its divisors is an integer number (7961352570).
Almost surely, 2106092011490 is an apocalyptic number.
106092011490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106092011490 is an abundant number, since it is smaller than the sum of its proper divisors (148671270750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106092011490 is a wasteful number, since it uses less digits than its factorization.
106092011490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1978546.
The product of its (nonzero) digits is 3888, while the sum is 33.
The spelling of 106092011490 in words is "one hundred six billion, ninety-two million, eleven thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •