Base | Representation |
---|---|
bin | 11101011101001100111… |
… | …01010010111011001001 |
3 | 10120202102200112210001220 |
4 | 32232212131102323021 |
5 | 113040300130341410 |
6 | 2052542410032253 |
7 | 133060013104533 |
oct | 16564635227311 |
9 | 3522380483056 |
10 | 1012110012105 |
11 | 360262797265 |
12 | 1441a1718689 |
13 | 7459816b08a |
14 | 36db4900853 |
15 | 1b4d99b8070 |
hex | eba6752ec9 |
1012110012105 has 128 divisors (see below), whose sum is σ = 1863347328000. Its totient is φ = 466033311744.
The previous prime is 1012110012101. The next prime is 1012110012113. The reversal of 1012110012105 is 5012100112101.
It is not a de Polignac number, because 1012110012105 - 22 = 1012110012101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (1012110012101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 25322697 + ... + 25362633.
It is an arithmetic number, because the mean of its divisors is an integer number (14557401000).
Almost surely, 21012110012105 is an apocalyptic number.
1012110012105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1012110012105 is a deficient number, since it is larger than the sum of its proper divisors (851237315895).
1012110012105 is a wasteful number, since it uses less digits than its factorization.
1012110012105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40163.
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 1012110012105 its reverse (5012100112101), we get a palindrome (6024210124206).
The spelling of 1012110012105 in words is "one trillion, twelve billion, one hundred ten million, twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.242 sec. • engine limits •