Base | Representation |
---|---|
bin | 110001010111010111… |
… | …0010011111011000011 |
3 | 101010122001121222221001 |
4 | 1202232232103323003 |
5 | 3214102202402130 |
6 | 120411154512431 |
7 | 10442020104115 |
oct | 1425656237303 |
9 | 333561558831 |
10 | 106010590915 |
11 | 40a60240009 |
12 | 18666895717 |
13 | 9cc5b46008 |
14 | 51b94293b5 |
15 | 2b56c656ca |
hex | 18aeb93ec3 |
106010590915 has 32 divisors (see below), whose sum is σ = 135628992000. Its totient is φ = 79315239168.
The previous prime is 106010590913. The next prime is 106010590927. The reversal of 106010590915 is 519095010601.
It is not a de Polignac number, because 106010590915 - 21 = 106010590913 is a prime.
It is a super-2 number, since 2×1060105909152 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106010590913) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5460696 + ... + 5480074.
It is an arithmetic number, because the mean of its divisors is an integer number (4238406000).
Almost surely, 2106010590915 is an apocalyptic number.
106010590915 is a deficient number, since it is larger than the sum of its proper divisors (29618401085).
106010590915 is a wasteful number, since it uses less digits than its factorization.
106010590915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20139.
The product of its (nonzero) digits is 12150, while the sum is 37.
The spelling of 106010590915 in words is "one hundred six billion, ten million, five hundred ninety thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •