Base | Representation |
---|---|
bin | 1001010011000100000011… |
… | …0110111100100101001111 |
3 | 1100012022122010122100002110 |
4 | 2110301000312330211033 |
5 | 2314443412214411343 |
6 | 33424233153155103 |
7 | 2103411126604116 |
oct | 224610066744517 |
9 | 40168563570073 |
10 | 10223110310223 |
11 | 3291662288358 |
12 | 1191382b5ba93 |
13 | 59205c34a175 |
14 | 274b30614c7d |
15 | 12add7216833 |
hex | 94c40dbc94f |
10223110310223 has 8 divisors (see below), whose sum is σ = 13647295991808. Its totient is φ = 6807165751064.
The previous prime is 10223110310219. The next prime is 10223110310267. The reversal of 10223110310223 is 32201301132201.
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 10223110310223 - 22 = 10223110310219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10223110310223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223110310293) 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, 2060277711 + ... + 2060282672.
It is an arithmetic number, because the mean of its divisors is an integer number (1705911998976).
Almost surely, 210223110310223 is an apocalyptic number.
10223110310223 is a deficient number, since it is larger than the sum of its proper divisors (3424185681585).
10223110310223 is an equidigital number, since it uses as much as digits as its factorization.
10223110310223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4120561213.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10223110310223 its reverse (32201301132201), we get a palindrome (42424411442424).
The spelling of 10223110310223 in words is "ten trillion, two hundred twenty-three billion, one hundred ten million, three hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •