Base | Representation |
---|---|
bin | 10011001111000101… |
… | …01100110011011011 |
3 | 222122201020020100220 |
4 | 21213202230303123 |
5 | 132122213144001 |
6 | 4424425131123 |
7 | 513625524231 |
oct | 114742546333 |
9 | 28581206326 |
10 | 10327084251 |
11 | 441a408280 |
12 | 2002629aa3 |
13 | c876ac053 |
14 | 6dd786951 |
15 | 40696bc36 |
hex | 2678accdb |
10327084251 has 8 divisors (see below), whose sum is σ = 15021213504. Its totient is φ = 6258838920.
The previous prime is 10327084247. The next prime is 10327084253. The reversal of 10327084251 is 15248072301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10327084251 - 22 = 10327084247 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 312941947 = 10327084251 / (1 + 0 + 3 + 2 + 7 + 0 + 8 + 4 + 2 + 5 + 1).
It is not an unprimeable number, because it can be changed into a prime (10327084253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 156470941 + ... + 156471006.
It is an arithmetic number, because the mean of its divisors is an integer number (1877651688).
Almost surely, 210327084251 is an apocalyptic number.
10327084251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10327084251 is a deficient number, since it is larger than the sum of its proper divisors (4694129253).
10327084251 is a wasteful number, since it uses less digits than its factorization.
10327084251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312941961.
The product of its (nonzero) digits is 13440, while the sum is 33.
The spelling of 10327084251 in words is "ten billion, three hundred twenty-seven million, eighty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •