Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …010100000110010010010001 |
3 | 111020222001210200100011210020 |
4 | 112333030232110012102101 |
5 | 101222410311110413410 |
6 | 555004412053454053 |
7 | 30203143356444441 |
oct | 2677145624062221 |
9 | 436861720304706 |
10 | 101100012201105 |
11 | 2a239302241025 |
12 | b409a39641329 |
13 | 44548c86038b8 |
14 | 1ad73a3b74121 |
15 | ba4c9b380a70 |
hex | 5bf32e506491 |
101100012201105 has 16 divisors (see below), whose sum is σ = 161761515901440. Its totient is φ = 53919507714048.
The previous prime is 101100012201059. The next prime is 101100012201127. The reversal of 101100012201105 is 501102210001101.
It is not a de Polignac number, because 101100012201105 - 28 = 101100012200849 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 29496097 + ... + 32744766.
It is an arithmetic number, because the mean of its divisors is an integer number (10110094743840).
Almost surely, 2101100012201105 is an apocalyptic number.
101100012201105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101100012201105 is a deficient number, since it is larger than the sum of its proper divisors (60661503700335).
101100012201105 is a wasteful number, since it uses less digits than its factorization.
101100012201105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62349160.
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 101100012201105 its reverse (501102210001101), we get a palindrome (602202222202206).
The spelling of 101100012201105 in words is "one hundred one trillion, one hundred billion, twelve million, two hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •