Base | Representation |
---|---|
bin | 1001010010010111110000… |
… | …1010101001110011011010 |
3 | 1100011011221111201211201211 |
4 | 2110211330022221303122 |
5 | 2314300034412230132 |
6 | 33414545255533334 |
7 | 2102510363361322 |
oct | 224457412516332 |
9 | 40134844654654 |
10 | 10211220430042 |
11 | 32876107aa3a5 |
12 | 118b00508a24a |
13 | 590bb5c603c8 |
14 | 2743234a0282 |
15 | 12a93d499147 |
hex | 9497c2a9cda |
10211220430042 has 8 divisors (see below), whose sum is σ = 15982779803616. Its totient is φ = 4883627162172.
The previous prime is 10211220430039. The next prime is 10211220430057. The reversal of 10211220430042 is 24003402211201.
10211220430042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102112204300422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10211220429995 and 10211220430022.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110991526368 + ... + 110991526459.
It is an arithmetic number, because the mean of its divisors is an integer number (1997847475452).
Almost surely, 210211220430042 is an apocalyptic number.
10211220430042 is a deficient number, since it is larger than the sum of its proper divisors (5771559373574).
10211220430042 is a wasteful number, since it uses less digits than its factorization.
10211220430042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221983052852.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10211220430042 its reverse (24003402211201), we get a palindrome (34214622641243).
The spelling of 10211220430042 in words is "ten trillion, two hundred eleven billion, two hundred twenty million, four hundred thirty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •