Base | Representation |
---|---|
bin | 1001010011000000101101… |
… | …0000110011110001100110 |
3 | 1100012020022110122202022101 |
4 | 2110300023100303301212 |
5 | 2314440042021321410 |
6 | 33424004032322314 |
7 | 2103346630611004 |
oct | 224601320636146 |
9 | 40166273582271 |
10 | 10222211120230 |
11 | 329124075962a |
12 | 11911719a339a |
13 | 591c47c78395 |
14 | 274a87029a74 |
15 | 12ad832e9d3a |
hex | 94c0b433c66 |
10222211120230 has 8 divisors (see below), whose sum is σ = 18399980016432. Its totient is φ = 4088884448088.
The previous prime is 10222211120167. The next prime is 10222211120263. The reversal of 10222211120230 is 3202111222201.
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 = 10222211120198 and 10222211120207.
It is a congruent number.
It is an unprimeable number.
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, 511110556002 + ... + 511110556021.
It is an arithmetic number, because the mean of its divisors is an integer number (2299997502054).
Almost surely, 210222211120230 is an apocalyptic number.
10222211120230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10222211120230 is a deficient number, since it is larger than the sum of its proper divisors (8177768896202).
10222211120230 is a wasteful number, since it uses less digits than its factorization.
10222211120230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022221112030.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 10222211120230 its reverse (3202111222201), we get a palindrome (13424322342431).
The spelling of 10222211120230 in words is "ten trillion, two hundred twenty-two billion, two hundred eleven million, one hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •