Base | Representation |
---|---|
bin | 1001010011000100011011… |
… | …0111011101111100111011 |
3 | 1100012022220011022111200001 |
4 | 2110301012313131330323 |
5 | 2314444114021011303 |
6 | 33424251153453431 |
7 | 2103413462440450 |
oct | 224610667357473 |
9 | 40168804274601 |
10 | 10223211110203 |
11 | 3291704175923 |
12 | 11913b0871277 |
13 | 5920771b0b20 |
14 | 274b3db73827 |
15 | 12ade0ec831d |
hex | 94c46dddf3b |
10223211110203 has 16 divisors (see below), whose sum is σ = 12754775513536. Its totient is φ = 7977890465280.
The previous prime is 10223211110201. The next prime is 10223211110209. The reversal of 10223211110203 is 30201111232201.
It is a cyclic number.
It is not a de Polignac number, because 10223211110203 - 21 = 10223211110201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10223211110201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 769465818 + ... + 769479103.
It is an arithmetic number, because the mean of its divisors is an integer number (797173469596).
Almost surely, 210223211110203 is an apocalyptic number.
10223211110203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10223211110203 is a deficient number, since it is larger than the sum of its proper divisors (2531564403333).
10223211110203 is a wasteful number, since it uses less digits than its factorization.
10223211110203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1538945014.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10223211110203 its reverse (30201111232201), we get a palindrome (40424322342404).
It can be divided in two parts, 10223 and 211110203, that added together give a triangular number (211120426 = T20548).
The spelling of 10223211110203 in words is "ten trillion, two hundred twenty-three billion, two hundred eleven million, one hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •