Base | Representation |
---|---|
bin | 1111001001110011110110… |
… | …0110100010001110110001 |
3 | 2011222210111111011000110121 |
4 | 3302130331212202032301 |
5 | 4140434130140344131 |
6 | 55234015512330241 |
7 | 3336506233232404 |
oct | 362347546421661 |
9 | 64883444130417 |
10 | 16661211653041 |
11 | 5343a8669197a |
12 | 1a5107a0a3981 |
13 | 93b1b7917257 |
14 | 41859a939d3b |
15 | 1dd5e2a39911 |
hex | f273d9a23b1 |
16661211653041 has 4 divisors (see below), whose sum is σ = 16684129413952. Its totient is φ = 16638293892132.
The previous prime is 16661211653027. The next prime is 16661211653059. The reversal of 16661211653041 is 14035611216661.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16661211653041 - 219 = 16661211128753 is a prime.
It is a super-3 number, since 3×166612116530413 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16661211653441) 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, 11458879365 + ... + 11458880818.
It is an arithmetic number, because the mean of its divisors is an integer number (4171032353488).
Almost surely, 216661211653041 is an apocalyptic number.
It is an amenable number.
16661211653041 is a deficient number, since it is larger than the sum of its proper divisors (22917760911).
16661211653041 is an equidigital number, since it uses as much as digits as its factorization.
16661211653041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22917760910.
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 16661211653041 in words is "sixteen trillion, six hundred sixty-one billion, two hundred eleven million, six hundred fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •