Base | Representation |
---|---|
bin | 11011110000110011011100… |
… | …000111010101111100011111 |
3 | 121000022202002020121022221110 |
4 | 123300303130013111330133 |
5 | 112001000343414444403 |
6 | 1111404234035433103 |
7 | 34501336115561160 |
oct | 3360633407257437 |
9 | 530282066538843 |
10 | 122101023203103 |
11 | 359a583148179a |
12 | 1183bbb5755793 |
13 | 5319100472ca9 |
14 | 2221a1480b767 |
15 | e1b1db5d4103 |
hex | 6f0cdc1d5f1f |
122101023203103 has 32 divisors (see below), whose sum is σ = 187896547238400. Its totient is φ = 69085193748480.
The previous prime is 122101023203059. The next prime is 122101023203129. The reversal of 122101023203103 is 301302320101221.
It is not a de Polignac number, because 122101023203103 - 29 = 122101023202591 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 122101023203103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101023201103) 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, 48190450 + ... + 50660847.
It is an arithmetic number, because the mean of its divisors is an integer number (5871767101200).
Almost surely, 2122101023203103 is an apocalyptic number.
122101023203103 is a deficient number, since it is larger than the sum of its proper divisors (65795524035297).
122101023203103 is a wasteful number, since it uses less digits than its factorization.
122101023203103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98851887.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 122101023203103 its reverse (301302320101221), we get a palindrome (423403343304324).
The spelling of 122101023203103 in words is "one hundred twenty-two trillion, one hundred one billion, twenty-three million, two hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •