Base | Representation |
---|---|
bin | 110001010111101001… |
… | …0101111010101111011 |
3 | 101010122201121011101002 |
4 | 1202233102233111323 |
5 | 3214112123443121 |
6 | 120412135315215 |
7 | 10442164216163 |
oct | 1425722572573 |
9 | 333581534332 |
10 | 106020140411 |
11 | 40a65672759 |
12 | 18669b1bb0b |
13 | 9cc7b0a7c3 |
14 | 51ba7d35a3 |
15 | 2b579eee0b |
hex | 18af4af57b |
106020140411 has 2 divisors, whose sum is σ = 106020140412. Its totient is φ = 106020140410.
The previous prime is 106020140407. The next prime is 106020140441. The reversal of 106020140411 is 114041020601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106020140411 - 22 = 106020140407 is a prime.
It is a super-2 number, since 2×1060201404112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106020140441) 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 as a sum of consecutive naturals, namely, 53010070205 + 53010070206.
It is an arithmetic number, because the mean of its divisors is an integer number (53010070206).
Almost surely, 2106020140411 is an apocalyptic number.
106020140411 is a deficient number, since it is larger than the sum of its proper divisors (1).
106020140411 is an equidigital number, since it uses as much as digits as its factorization.
106020140411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
The spelling of 106020140411 in words is "one hundred six billion, twenty million, one hundred forty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •