Base | Representation |
---|---|
bin | 1001010011000100111000… |
… | …0100101101101100111111 |
3 | 1100012100012120211111222121 |
4 | 2110301032010231230333 |
5 | 2314444340444214403 |
6 | 33424311153223411 |
7 | 2103416461253263 |
oct | 224611604555477 |
9 | 40170176744877 |
10 | 10223332023103 |
11 | 3291766450541 |
12 | 1191425261b67 |
13 | 592096267414 |
14 | 274b51c4a0a3 |
15 | 12adeb90e3bd |
hex | 94c4e12db3f |
10223332023103 has 4 divisors (see below), whose sum is σ = 10247731383960. Its totient is φ = 10198932662248.
The previous prime is 10223332023083. The next prime is 10223332023131. The reversal of 10223332023103 is 30132023332201.
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 10223332023103 - 25 = 10223332023071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223332323103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12199679800 + ... + 12199680637.
It is an arithmetic number, because the mean of its divisors is an integer number (2561932845990).
Almost surely, 210223332023103 is an apocalyptic number.
10223332023103 is a deficient number, since it is larger than the sum of its proper divisors (24399360857).
10223332023103 is an equidigital number, since it uses as much as digits as its factorization.
10223332023103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24399360856.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 10223332023103 its reverse (30132023332201), we get a palindrome (40355355355304).
The spelling of 10223332023103 in words is "ten trillion, two hundred twenty-three billion, three hundred thirty-two million, twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •