Base | Representation |
---|---|
bin | 110001110100111100… |
… | …0000111001000001011 |
3 | 101020012020001101210020 |
4 | 1203221320013020023 |
5 | 3223120233000231 |
6 | 121053445551523 |
7 | 10505430424605 |
oct | 1435170071013 |
9 | 336166041706 |
10 | 107003015691 |
11 | 4141a45a480 |
12 | 188a31155a3 |
13 | a123630200 |
14 | 5271164175 |
15 | 2bb3e4c396 |
hex | 18e9e0720b |
107003015691 has 48 divisors (see below), whose sum is σ = 172645022592. Its totient is φ = 58401657600.
The previous prime is 107003015659. The next prime is 107003015741. The reversal of 107003015691 is 196510300701.
It is a happy number.
It is not a de Polignac number, because 107003015691 - 25 = 107003015659 is a prime.
It is a super-2 number, since 2×1070030156912 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (107003015891) 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 47 ways as a sum of consecutive naturals, for example, 5325 + ... + 462638.
It is an arithmetic number, because the mean of its divisors is an integer number (3596771304).
Almost surely, 2107003015691 is an apocalyptic number.
107003015691 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
107003015691 is a deficient number, since it is larger than the sum of its proper divisors (65642006901).
107003015691 is a wasteful number, since it uses less digits than its factorization.
107003015691 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468044 (or 468031 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 33.
The spelling of 107003015691 in words is "one hundred seven billion, three million, fifteen thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •