Base | Representation |
---|---|
bin | 1010000000010010110001101… |
… | …0100111111110100010001011 |
3 | 10102022200200220010101110121002 |
4 | 2200010230122213332202023 |
5 | 1214234000000304324321 |
6 | 10533145422332005215 |
7 | 301201021236551252 |
oct | 24004543247764213 |
9 | 3368620803343532 |
10 | 704010011011211 |
11 | 194356a72792673 |
12 | 66b61a3430080b |
13 | 242a9b227c2668 |
14 | c5bc3a2bab799 |
15 | 565cdb177d20b |
hex | 2804b1a9fe88b |
704010011011211 has 4 divisors (see below), whose sum is σ = 704032964646624. Its totient is φ = 703987057375800.
The previous prime is 704010011011051. The next prime is 704010011011273. The reversal of 704010011011211 is 112110110010407.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-704010011011211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (704010061011211) 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 in 3 ways as a sum of consecutive naturals, for example, 11476771700 + ... + 11476833041.
It is an arithmetic number, because the mean of its divisors is an integer number (176008241161656).
Almost surely, 2704010011011211 is an apocalyptic number.
704010011011211 is a deficient number, since it is larger than the sum of its proper divisors (22953635413).
704010011011211 is a wasteful number, since it uses less digits than its factorization.
704010011011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22953635412.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 704010011011211 its reverse (112110110010407), we get a palindrome (816120121021618).
The spelling of 704010011011211 in words is "seven hundred four trillion, ten billion, eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •