Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …001011001011101100010011 |
3 | 111020122110110120200200020002 |
4 | 112331320321023023230103 |
5 | 101214421440011200430 |
6 | 554455204202040215 |
7 | 30163505652301151 |
oct | 2675707113135423 |
9 | 436573416620202 |
10 | 101010000100115 |
11 | 2a204111805317 |
12 | b3b44b87a906b |
13 | 4449282135692 |
14 | 1ad2ca54063d1 |
15 | ba277de13845 |
hex | 5bde392cbb13 |
101010000100115 has 4 divisors (see below), whose sum is σ = 121212000120144. Its totient is φ = 80808000080088.
The previous prime is 101010000100111. The next prime is 101010000100213. The reversal of 101010000100115 is 511001000010101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101010000100115 - 22 = 101010000100111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010000100096 and 101010000100105.
It is not an unprimeable number, because it can be changed into a prime (101010000100111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10101000010007 + ... + 10101000010016.
It is an arithmetic number, because the mean of its divisors is an integer number (30303000030036).
Almost surely, 2101010000100115 is an apocalyptic number.
101010000100115 is a deficient number, since it is larger than the sum of its proper divisors (20202000020029).
101010000100115 is an equidigital number, since it uses as much as digits as its factorization.
101010000100115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20202000020028.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 101010000100115 its reverse (511001000010101), we get a palindrome (612011000110216).
The spelling of 101010000100115 in words is "one hundred one trillion, ten billion, one hundred thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •