Base | Representation |
---|---|
bin | 10000000101000111101… |
… | …111000001111011100001 |
3 | 10220122020001110112020020 |
4 | 100011013233001323201 |
5 | 121101030041343311 |
6 | 2203345025304053 |
7 | 142556115632550 |
oct | 20050757017341 |
9 | 3818201415206 |
10 | 1105010106081 |
11 | 3966a5440932 |
12 | 15a1a9795029 |
13 | 80281a64a9b |
14 | 3b6a8a39d97 |
15 | 1db25751c06 |
hex | 10147bc1ee1 |
1105010106081 has 16 divisors (see below), whose sum is σ = 1688649648000. Its totient is φ = 629625074688.
The previous prime is 1105010106073. The next prime is 1105010106089. The reversal of 1105010106081 is 1806010105011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1105010106073) and next prime (1105010106089).
It is not a de Polignac number, because 1105010106081 - 23 = 1105010106073 is a prime.
It is a super-2 number, since 2×11050101060812 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1105010106089) 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 15 ways as a sum of consecutive naturals, for example, 75378816 + ... + 75393473.
It is an arithmetic number, because the mean of its divisors is an integer number (105540603000).
Almost surely, 21105010106081 is an apocalyptic number.
It is an amenable number.
1105010106081 is a deficient number, since it is larger than the sum of its proper divisors (583639541919).
1105010106081 is a wasteful number, since it uses less digits than its factorization.
1105010106081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150772648.
The product of its (nonzero) digits is 240, while the sum is 24.
The spelling of 1105010106081 in words is "one trillion, one hundred five billion, ten million, one hundred six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •