Base | Representation |
---|---|
bin | 1001001100100110001101… |
… | …1010111011111000111111 |
3 | 1022210200220010112200202022 |
4 | 2103021203122323320333 |
5 | 2311133404340121343 |
6 | 33301222012150355 |
7 | 2062366210325063 |
oct | 223114332737077 |
9 | 38720803480668 |
10 | 10112021020223 |
11 | 3249536278581 |
12 | 117393b4683bb |
13 | 58473727c385 |
14 | 26d5d28bdaa3 |
15 | 1280846a1568 |
hex | 932636bbe3f |
10112021020223 has 8 divisors (see below), whose sum is σ = 10481307278592. Its totient is φ = 9749157131736.
The previous prime is 10112021020193. The next prime is 10112021020247. The reversal of 10112021020223 is 32202012021101.
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 10112021020223 - 216 = 10112020954687 is a prime.
It is a super-2 number, since 2×101120210202232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112021020723) 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, 1605589265 + ... + 1605595562.
It is an arithmetic number, because the mean of its divisors is an integer number (1310163409824).
Almost surely, 210112021020223 is an apocalyptic number.
10112021020223 is a deficient number, since it is larger than the sum of its proper divisors (369286258369).
10112021020223 is an equidigital number, since it uses as much as digits as its factorization.
10112021020223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3211184941.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10112021020223 its reverse (32202012021101), we get a palindrome (42314033041324).
The spelling of 10112021020223 in words is "ten trillion, one hundred twelve billion, twenty-one million, twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •