Base | Representation |
---|---|
bin | 1001000111010110101111… |
… | …1101101100001000001101 |
3 | 1022111002110022201200100021 |
4 | 2101311223331230020031 |
5 | 2303144443312111323 |
6 | 33152010211102141 |
7 | 2053030521512143 |
oct | 221655375541015 |
9 | 38432408650307 |
10 | 10021970035213 |
11 | 32143258a3714 |
12 | 115a3a95a1951 |
13 | 5790b5a18566 |
14 | 2690ccd0d593 |
15 | 125a63b0305d |
hex | 91d6bf6c20d |
10021970035213 has 8 divisors (see below), whose sum is σ = 10042794468000. Its totient is φ = 10001148564720.
The previous prime is 10021970035139. The next prime is 10021970035229. The reversal of 10021970035213 is 31253007912001.
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 10021970035213 - 213 = 10021970027021 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 (10021970035313) 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, 6098331 + ... + 7565287.
It is an arithmetic number, because the mean of its divisors is an integer number (1255349308500).
Almost surely, 210021970035213 is an apocalyptic number.
It is an amenable number.
10021970035213 is a deficient number, since it is larger than the sum of its proper divisors (20824432787).
10021970035213 is a wasteful number, since it uses less digits than its factorization.
10021970035213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1481147.
The product of its (nonzero) digits is 11340, while the sum is 34.
Adding to 10021970035213 its reverse (31253007912001), we get a palindrome (41274977947214).
The spelling of 10021970035213 in words is "ten trillion, twenty-one billion, nine hundred seventy million, thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •