Base | Representation |
---|---|
bin | 1001110000000101111100… |
… | …1010100011111100100001 |
3 | 1101221222221010002022022102 |
4 | 2130001133022203330201 |
5 | 2401131304223200014 |
6 | 34445313141420145 |
7 | 2154425031401144 |
oct | 234013712437441 |
9 | 41858833068272 |
10 | 10721834975009 |
11 | 3464117364604 |
12 | 1251b68a0a655 |
13 | 5ca0ac1b7702 |
14 | 290d222d805b |
15 | 138d75dcc8de |
hex | 9c05f2a3f21 |
10721834975009 has 4 divisors (see below), whose sum is σ = 10822039040304. Its totient is φ = 10621630909716.
The previous prime is 10721834974999. The next prime is 10721834975023. The reversal of 10721834975009 is 90057943812701.
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 10721834975009 - 216 = 10721834909473 is a prime.
It is a super-2 number, since 2×107218349750092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10721834974009) 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, 50102032487 + ... + 50102032700.
It is an arithmetic number, because the mean of its divisors is an integer number (2705509760076).
Almost surely, 210721834975009 is an apocalyptic number.
It is an amenable number.
10721834975009 is a deficient number, since it is larger than the sum of its proper divisors (100204065295).
10721834975009 is a wasteful number, since it uses less digits than its factorization.
10721834975009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100204065294.
The product of its (nonzero) digits is 3810240, while the sum is 56.
The spelling of 10721834975009 in words is "ten trillion, seven hundred twenty-one billion, eight hundred thirty-four million, nine hundred seventy-five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •