Base | Representation |
---|---|
bin | 1001001000100001011001… |
… | …1101010101000110111001 |
3 | 1022120000011222001220101101 |
4 | 2102020112131111012321 |
5 | 2304012014120403213 |
6 | 33205122540051401 |
7 | 2054340243253222 |
oct | 222102635250671 |
9 | 38500158056341 |
10 | 10042010325433 |
11 | 322187a041339 |
12 | 1162260b33b61 |
13 | 57ac5a85bb58 |
14 | 26a0706c2249 |
15 | 12633817bbdd |
hex | 922167551b9 |
10042010325433 has 8 divisors (see below), whose sum is σ = 10058960560320. Its totient is φ = 10025062437840.
The previous prime is 10042010325401. The next prime is 10042010325463. The reversal of 10042010325433 is 33452301024001.
It is a happy number.
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 10042010325433 - 25 = 10042010325401 is a prime.
It is a super-2 number, since 2×100420103254332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10042010325463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8084628 + ... + 9243658.
It is an arithmetic number, because the mean of its divisors is an integer number (1257370070040).
Almost surely, 210042010325433 is an apocalyptic number.
It is an amenable number.
10042010325433 is a deficient number, since it is larger than the sum of its proper divisors (16950234887).
10042010325433 is a wasteful number, since it uses less digits than its factorization.
10042010325433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1173647.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 10042010325433 its reverse (33452301024001), we get a palindrome (43494311349434).
The spelling of 10042010325433 in words is "ten trillion, forty-two billion, ten million, three hundred twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •