Base | Representation |
---|---|
bin | 1001010011000100011111… |
… | …1111111111100001110111 |
3 | 1100012022221111002102002111 |
4 | 2110301013333333201313 |
5 | 2314444133402401403 |
6 | 33424253113151451 |
7 | 2103414113152645 |
oct | 224610777774167 |
9 | 40168844072074 |
10 | 10223230122103 |
11 | 3291713980839 |
12 | 11913b70bb587 |
13 | 59207b10957b |
14 | 274b424c2195 |
15 | 12ade29d156d |
hex | 94c47fff877 |
10223230122103 has 4 divisors (see below), whose sum is σ = 10224676335160. Its totient is φ = 10221783909048.
The previous prime is 10223230122059. The next prime is 10223230122139. The reversal of 10223230122103 is 30122103232201.
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 10223230122103 - 233 = 10214640187511 is a prime.
It is a super-3 number, since 3×102232301221033 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223230122803) 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, 723095925 + ... + 723110062.
It is an arithmetic number, because the mean of its divisors is an integer number (2556169083790).
Almost surely, 210223230122103 is an apocalyptic number.
10223230122103 is a deficient number, since it is larger than the sum of its proper divisors (1446213057).
10223230122103 is an equidigital number, since it uses as much as digits as its factorization.
10223230122103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1446213056.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10223230122103 its reverse (30122103232201), we get a palindrome (40345333354304).
The spelling of 10223230122103 in words is "ten trillion, two hundred twenty-three billion, two hundred thirty million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •