Base | Representation |
---|---|
bin | 110011110101000000010… |
… | …0101111111100010110101 |
3 | 221012222020222101002002122 |
4 | 1213222000211333202311 |
5 | 1413201320041020041 |
6 | 23052205312245325 |
7 | 1333430602233053 |
oct | 147520045774265 |
9 | 27188228332078 |
10 | 7123213220021 |
11 | 22a6a351851a8 |
12 | 970639840845 |
13 | 3c894042c902 |
14 | 1a8aa02091d3 |
15 | c5457814c4b |
hex | 67a8097f8b5 |
7123213220021 has 8 divisors (see below), whose sum is σ = 7125865478784. Its totient is φ = 7120561235040.
The previous prime is 7123213219937. The next prime is 7123213220027. The reversal of 7123213220021 is 1200223123217.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 7123213220021 - 238 = 6848335313077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7123213220027) 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 7 ways as a sum of consecutive naturals, for example, 62308505 + ... + 62422721.
It is an arithmetic number, because the mean of its divisors is an integer number (890733184848).
Almost surely, 27123213220021 is an apocalyptic number.
It is an amenable number.
7123213220021 is a deficient number, since it is larger than the sum of its proper divisors (2652258763).
7123213220021 is a wasteful number, since it uses less digits than its factorization.
7123213220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136891.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 7123213220021 its reverse (1200223123217), we get a palindrome (8323436343238).
The spelling of 7123213220021 in words is "seven trillion, one hundred twenty-three billion, two hundred thirteen million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •