Base | Representation |
---|---|
bin | 110000111011101010… |
… | …1101001001000001010 |
3 | 101001020022011001110121 |
4 | 1201313111221020022 |
5 | 3210201313033130 |
6 | 120135042333454 |
7 | 10410004653361 |
oct | 1416725511012 |
9 | 331208131417 |
10 | 105081377290 |
11 | 4062377506a |
12 | 1844765a28a |
13 | 9ba8491576 |
14 | 512bc667d8 |
15 | 2b003b7d7a |
hex | 187756920a |
105081377290 has 32 divisors (see below), whose sum is σ = 189514092240. Its totient is φ = 41950946304.
The previous prime is 105081377267. The next prime is 105081377293. The reversal of 105081377290 is 92773180501.
It can be written as a sum of positive squares in 8 ways, for example, as 59938301329 + 45143075961 = 244823^2 + 212469^2 .
It is a super-2 number, since 2×1050813772902 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105081377293) by changing a digit.
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, 12089266 + ... + 12097954.
Almost surely, 2105081377290 is an apocalyptic number.
105081377290 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105081377290 is a deficient number, since it is larger than the sum of its proper divisors (84432714950).
105081377290 is a wasteful number, since it uses less digits than its factorization.
105081377290 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10906.
The product of its (nonzero) digits is 105840, while the sum is 43.
The spelling of 105081377290 in words is "one hundred five billion, eighty-one million, three hundred seventy-seven thousand, two hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •