Base | Representation |
---|---|
bin | 1001010011100001110111… |
… | …0111001010101110111111 |
3 | 1100020002021212022012011002 |
4 | 2110320131313022232333 |
5 | 2320111304423201343 |
6 | 33432035232520515 |
7 | 2104113343314311 |
oct | 224703567125677 |
9 | 40202255265132 |
10 | 10231113100223 |
11 | 3294a99690994 |
12 | 1192a370b013b |
13 | 592a36329172 |
14 | 27528d4077b1 |
15 | 12b204ab38b8 |
hex | 94e1ddcabbf |
10231113100223 has 4 divisors (see below), whose sum is σ = 10252472418240. Its totient is φ = 10209753782208.
The previous prime is 10231113100183. The next prime is 10231113100237. The reversal of 10231113100223 is 32200131113201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10231113100223 - 226 = 10231045991359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10231113100195 and 10231113100204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231113100123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10679658290 + ... + 10679659247.
It is an arithmetic number, because the mean of its divisors is an integer number (2563118104560).
Almost surely, 210231113100223 is an apocalyptic number.
10231113100223 is a deficient number, since it is larger than the sum of its proper divisors (21359318017).
10231113100223 is an equidigital number, since it uses as much as digits as its factorization.
10231113100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21359318016.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10231113100223 its reverse (32200131113201), we get a palindrome (42431244213424).
The spelling of 10231113100223 in words is "ten trillion, two hundred thirty-one billion, one hundred thirteen million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •