Base | Representation |
---|---|
bin | 1001010111110001111010… |
… | …1111100111101101111001 |
3 | 1100111001210101201002221211 |
4 | 2111330132233213231321 |
5 | 2322310340414434113 |
6 | 33525354015003121 |
7 | 2112310152532540 |
oct | 225743657475571 |
9 | 40431711632854 |
10 | 10304142343033 |
11 | 3312a647a6a10 |
12 | 11a50185094a1 |
13 | 5998a4226486 |
14 | 278a1a479157 |
15 | 12d07b0e2b3d |
hex | 95f1ebe7b79 |
10304142343033 has 64 divisors (see below), whose sum is σ = 13175237836800. Its totient is φ = 7826718493440.
The previous prime is 10304142343007. The next prime is 10304142343039. The reversal of 10304142343033 is 33034324140301.
It is not a de Polignac number, because 10304142343033 - 225 = 10304108788601 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10304142342986 and 10304142343004.
It is not an unprimeable number, because it can be changed into a prime (10304142343039) 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 63 ways as a sum of consecutive naturals, for example, 254849863 + ... + 254890291.
It is an arithmetic number, because the mean of its divisors is an integer number (205863091200).
Almost surely, 210304142343033 is an apocalyptic number.
It is an amenable number.
10304142343033 is a deficient number, since it is larger than the sum of its proper divisors (2871095493767).
10304142343033 is a wasteful number, since it uses less digits than its factorization.
10304142343033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41030.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 10304142343033 its reverse (33034324140301), we get a palindrome (43338466483334).
The spelling of 10304142343033 in words is "ten trillion, three hundred four billion, one hundred forty-two million, three hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •