Base | Representation |
---|---|
bin | 1001000111001001001001… |
… | …1001111111010100101101 |
3 | 1022110202000221120201211120 |
4 | 2101302102121333110231 |
5 | 2303120004411131111 |
6 | 33150204102411153 |
7 | 2052541211062512 |
oct | 221622231772455 |
9 | 38422027521746 |
10 | 10018320020781 |
11 | 3212822524866 |
12 | 115974b130ab9 |
13 | 5789537765c7 |
14 | 268c64261309 |
15 | 1258ed462406 |
hex | 91c9267f52d |
10018320020781 has 8 divisors (see below), whose sum is σ = 13641967688064. Its totient is φ = 6536776183680.
The previous prime is 10018320020773. The next prime is 10018320020857. The reversal of 10018320020781 is 18702002381001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10018320020781 - 23 = 10018320020773 is a prime.
It is a super-2 number, since 2×100183200207812 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10018320020381) 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, 35525957380 + ... + 35525957661.
It is an arithmetic number, because the mean of its divisors is an integer number (1705245961008).
Almost surely, 210018320020781 is an apocalyptic number.
It is an amenable number.
10018320020781 is a deficient number, since it is larger than the sum of its proper divisors (3623647667283).
10018320020781 is an equidigital number, since it uses as much as digits as its factorization.
10018320020781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71051915091.
The product of its (nonzero) digits is 5376, while the sum is 33.
The spelling of 10018320020781 in words is "ten trillion, eighteen billion, three hundred twenty million, twenty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •