Base | Representation |
---|---|
bin | 10001011110100111010… |
… | …001101111001001011111 |
3 | 11020211020212220210001101 |
4 | 101132213101233021133 |
5 | 124134324143221343 |
6 | 2315440115053531 |
7 | 152530302161431 |
oct | 21364721571137 |
9 | 4224225823041 |
10 | 1201102320223 |
11 | 423425a46643 |
12 | 1749468a12a7 |
13 | 89356a9b7b0 |
14 | 421c2aac651 |
15 | 2139b87de4d |
hex | 117a746f25f |
1201102320223 has 32 divisors (see below), whose sum is σ = 1341134625600. Its totient is φ = 1068052608000.
The previous prime is 1201102320217. The next prime is 1201102320241. The reversal of 1201102320223 is 3220232011021.
It is a cyclic number.
It is not a de Polignac number, because 1201102320223 - 229 = 1200565449311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1201102320223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201102350223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 404546283 + ... + 404549251.
It is an arithmetic number, because the mean of its divisors is an integer number (41910457050).
Almost surely, 21201102320223 is an apocalyptic number.
1201102320223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1201102320223 is a deficient number, since it is larger than the sum of its proper divisors (140032305377).
1201102320223 is a wasteful number, since it uses less digits than its factorization.
1201102320223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5083.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1201102320223 its reverse (3220232011021), we get a palindrome (4421334331244).
The spelling of 1201102320223 in words is "one trillion, two hundred one billion, one hundred two million, three hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •