Base | Representation |
---|---|
bin | 1001010111110010111111… |
… | …1101001111001111001011 |
3 | 1100111002112112002202221221 |
4 | 2111330233331033033023 |
5 | 2322311433332003301 |
6 | 33525442412342511 |
7 | 2112320260252021 |
oct | 225745775171713 |
9 | 40432475082857 |
10 | 10304431125451 |
11 | 33130a2809471 |
12 | 11a5099174a37 |
13 | 59991bcc7448 |
14 | 278a4696c711 |
15 | 12d096637da1 |
hex | 95f2ff4f3cb |
10304431125451 has 8 divisors (see below), whose sum is σ = 10322438634144. Its totient is φ = 10286434150080.
The previous prime is 10304431125403. The next prime is 10304431125473. The reversal of 10304431125451 is 15452113440301.
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 10304431125451 - 223 = 10304422736843 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10304431125481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 673810 + ... + 4589431.
It is an arithmetic number, because the mean of its divisors is an integer number (1290304829268).
Almost surely, 210304431125451 is an apocalyptic number.
10304431125451 is a deficient number, since it is larger than the sum of its proper divisors (18007508693).
10304431125451 is an equidigital number, since it uses as much as digits as its factorization.
10304431125451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5266661.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 10304431125451 its reverse (15452113440301), we get a palindrome (25756544565752).
The spelling of 10304431125451 in words is "ten trillion, three hundred four billion, four hundred thirty-one million, one hundred twenty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •