Base | Representation |
---|---|
bin | 11101000111000001111… |
… | …111011101111110001001 |
3 | 21002020102022200020101102 |
4 | 131013001333131332021 |
5 | 230233322043330121 |
6 | 4130551103431145 |
7 | 264345064062014 |
oct | 35070177357611 |
9 | 7066368606342 |
10 | 2000414433161 |
11 | 701409884631 |
12 | 28383a8b54b5 |
13 | 11683b38a2b1 |
14 | 6cb6b93037b |
15 | 3707e59290b |
hex | 1d1c1fddf89 |
2000414433161 has 4 divisors (see below), whose sum is σ = 2002748639892. Its totient is φ = 1998080226432.
The previous prime is 2000414433139. The next prime is 2000414433169. The reversal of 2000414433161 is 1613344140002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1868877650761 + 131536782400 = 1367069^2 + 362680^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000414433161 - 234 = 1983234563977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000414433169) 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, 1167102080 + ... + 1167103793.
It is an arithmetic number, because the mean of its divisors is an integer number (500687159973).
Almost surely, 22000414433161 is an apocalyptic number.
It is an amenable number.
2000414433161 is a deficient number, since it is larger than the sum of its proper divisors (2334206731).
2000414433161 is an equidigital number, since it uses as much as digits as its factorization.
2000414433161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2334206730.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 2000414433161 its reverse (1613344140002), we get a palindrome (3613758573163).
The spelling of 2000414433161 in words is "two trillion, four hundred fourteen million, four hundred thirty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •