Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1101100100111101001 |
3 | 100202022022222220120120 |
4 | 1133000111230213221 |
5 | 3132404324123230 |
6 | 114510245113453 |
7 | 10240634363562 |
oct | 1370025544751 |
9 | 322268886516 |
10 | 102011161065 |
11 | 3a298706190 |
12 | 1792b3b8889 |
13 | 9809393c88 |
14 | 4d1a1c3169 |
15 | 29c0aa4310 |
hex | 17c056c9e9 |
102011161065 has 32 divisors (see below), whose sum is σ = 183799590912. Its totient is φ = 47864472000.
The previous prime is 102011161037. The next prime is 102011161067. The reversal of 102011161065 is 560161110201.
It is not a de Polignac number, because 102011161065 - 217 = 102011029993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102011161067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9966651 + ... + 9976880.
It is an arithmetic number, because the mean of its divisors is an integer number (5743737216).
Almost surely, 2102011161065 is an apocalyptic number.
102011161065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
102011161065 is a deficient number, since it is larger than the sum of its proper divisors (81788429847).
102011161065 is a wasteful number, since it uses less digits than its factorization.
102011161065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19943581.
The product of its (nonzero) digits is 360, while the sum is 24.
Adding to 102011161065 its reverse (560161110201), we get a palindrome (662172271266).
The spelling of 102011161065 in words is "one hundred two billion, eleven million, one hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •