Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …1010111100010100000110 |
3 | 1100010012212001101020110211 |
4 | 2110130201222330110012 |
5 | 2314113334212430342 |
6 | 33410154250110034 |
7 | 2102002033204621 |
oct | 224344152742406 |
9 | 40105761336424 |
10 | 10201112233222 |
11 | 32832a3a05529 |
12 | 1189063a1b31a |
13 | 58cc64a1c561 |
14 | 273a44c14db8 |
15 | 12a54ad67c17 |
hex | 94721abc506 |
10201112233222 has 8 divisors (see below), whose sum is σ = 15530051459736. Its totient is φ = 5024428413312.
The previous prime is 10201112233199. The next prime is 10201112233223. The reversal of 10201112233222 is 22233221110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10201112233193 and 10201112233202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201112233223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38063851483 + ... + 38063851750.
It is an arithmetic number, because the mean of its divisors is an integer number (1941256432467).
Almost surely, 210201112233222 is an apocalyptic number.
10201112233222 is a deficient number, since it is larger than the sum of its proper divisors (5328939226514).
10201112233222 is an equidigital number, since it uses as much as digits as its factorization.
10201112233222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76127703302.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 10201112233222 its reverse (22233221110201), we get a palindrome (32434333343423).
The spelling of 10201112233222 in words is "ten trillion, two hundred one billion, one hundred twelve million, two hundred thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •