Base | Representation |
---|---|
bin | 10011001100010101… |
… | …01001000000101010 |
3 | 222121002210102210012 |
4 | 21212022221000222 |
5 | 132100311000132 |
6 | 4422242251522 |
7 | 513225361310 |
oct | 114612510052 |
9 | 28532712705 |
10 | 10304000042 |
11 | 4408380816 |
12 | 1bb6956ba2 |
13 | c82988b5b |
14 | 6da6980b0 |
15 | 40490c0b2 |
hex | 2662a902a |
10304000042 has 8 divisors (see below), whose sum is σ = 17664000096. Its totient is φ = 4416000012.
The previous prime is 10304000039. The next prime is 10304000051. The reversal of 10304000042 is 24000040301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×103040000424 (a number of 41 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 736000003 = 10304000042 / (1 + 0 + 3 + 0 + 4 + 0 + 0 + 0 + 0 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10303999990 and 10304000026.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 367999988 + ... + 368000015.
It is an arithmetic number, because the mean of its divisors is an integer number (2208000012).
Almost surely, 210304000042 is an apocalyptic number.
10304000042 is a deficient number, since it is larger than the sum of its proper divisors (7360000054).
10304000042 is an equidigital number, since it uses as much as digits as its factorization.
10304000042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736000012.
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 10304000042 its reverse (24000040301), we get a palindrome (34304040343).
The spelling of 10304000042 in words is "ten billion, three hundred four million, forty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •