Base | Representation |
---|---|
bin | 1001000111010110111110… |
… | …0111110100111100101001 |
3 | 1022111002121121012222212212 |
4 | 2101311233213310330221 |
5 | 2303200110020204113 |
6 | 33152020242414505 |
7 | 2053032165305213 |
oct | 221655747647451 |
9 | 38432547188785 |
10 | 10022031413033 |
11 | 3214357505792 |
12 | 115a406061435 |
13 | 5790c56586b3 |
14 | 2690d71295b3 |
15 | 125a691c90a8 |
hex | 91d6f9f4f29 |
10022031413033 has 8 divisors (see below), whose sum is σ = 10152417945600. Its totient is φ = 9891733015008.
The previous prime is 10022031412997. The next prime is 10022031413041. The reversal of 10022031413033 is 33031413022001.
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 10022031413033 - 210 = 10022031412009 is a prime.
It is a super-2 number, since 2×100220314130332 (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 (10022031419033) 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, 21804716 + ... + 22259597.
It is an arithmetic number, because the mean of its divisors is an integer number (1269052243200).
Almost surely, 210022031413033 is an apocalyptic number.
It is an amenable number.
10022031413033 is a deficient number, since it is larger than the sum of its proper divisors (130386532567).
10022031413033 is an equidigital number, since it uses as much as digits as its factorization.
10022031413033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44067271.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10022031413033 its reverse (33031413022001), we get a palindrome (43053444435034).
The spelling of 10022031413033 in words is "ten trillion, twenty-two billion, thirty-one million, four hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •