Base | Representation |
---|---|
bin | 1001010011000000101010… |
… | …0111010001110000111111 |
3 | 1100012020021201011121212111 |
4 | 2110300022213101300333 |
5 | 2314440031224424043 |
6 | 33424003003114451 |
7 | 2103346436224612 |
oct | 224601247216077 |
9 | 40166251147774 |
10 | 10222200233023 |
11 | 32912355a2939 |
12 | 119116a212a27 |
13 | 591c45935a4c |
14 | 274a857d4179 |
15 | 12ad8239909d |
hex | 94c0a9d1c3f |
10222200233023 has 8 divisors (see below), whose sum is σ = 10482088853376. Its totient is φ = 9962814787200.
The previous prime is 10222200232991. The next prime is 10222200233053. The reversal of 10222200233023 is 32033200222201.
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 10222200233023 - 25 = 10222200232991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10222200232985 and 10222200233003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222200233053) 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, 125752486 + ... + 125833747.
It is an arithmetic number, because the mean of its divisors is an integer number (1310261106672).
Almost surely, 210222200233023 is an apocalyptic number.
10222200233023 is a deficient number, since it is larger than the sum of its proper divisors (259888620353).
10222200233023 is an equidigital number, since it uses as much as digits as its factorization.
10222200233023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251587265.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 10222200233023 its reverse (32033200222201), we get a palindrome (42255400455224).
The spelling of 10222200233023 in words is "ten trillion, two hundred twenty-two billion, two hundred million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •