Base | Representation |
---|---|
bin | 1001010011000000101111… |
… | …0111010110000010000111 |
3 | 1100012020100011122222100212 |
4 | 2110300023313112002013 |
5 | 2314440102113101043 |
6 | 33424005033030035 |
7 | 2103350112513206 |
oct | 224601367260207 |
9 | 40166304588325 |
10 | 10222221222023 |
11 | 3291246429218 |
12 | 119117525531b |
13 | 591c4a0a4385 |
14 | 274a884d923d |
15 | 12ad84143018 |
hex | 94c0bdd6087 |
10222221222023 has 8 divisors (see below), whose sum is σ = 10260446861376. Its totient is φ = 10183999298400.
The previous prime is 10222221221983. The next prime is 10222221222089. The reversal of 10222221222023 is 32022212222201.
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 10222221222023 - 212 = 10222221217927 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10222221222023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222223222023) 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, 4645913 + ... + 6482973.
It is an arithmetic number, because the mean of its divisors is an integer number (1282555857672).
Almost surely, 210222221222023 is an apocalyptic number.
10222221222023 is a deficient number, since it is larger than the sum of its proper divisors (38225639353).
10222221222023 is a wasteful number, since it uses less digits than its factorization.
10222221222023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1857865.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 10222221222023 its reverse (32022212222201), we get a palindrome (42244433444224).
The spelling of 10222221222023 in words is "ten trillion, two hundred twenty-two billion, two hundred twenty-one million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •