Base | Representation |
---|---|
bin | 111001010010010100… |
… | …0010101101000110101 |
3 | 102202112112221111220121 |
4 | 1302210220111220311 |
5 | 4003421401401401 |
6 | 132303133331541 |
7 | 11613402166363 |
oct | 1624450255065 |
9 | 382475844817 |
10 | 123021122101 |
11 | 4819a241949 |
12 | 1ba13636bb1 |
13 | b7a7085997 |
14 | 5d5068a633 |
15 | 330031cca1 |
hex | 1ca4a15a35 |
123021122101 has 4 divisors (see below), whose sum is σ = 125638592832. Its totient is φ = 120403651372.
The previous prime is 123021122057. The next prime is 123021122129. The reversal of 123021122101 is 101221120321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 123021122101 - 27 = 123021121973 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 (123021122201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1308735295 + ... + 1308735388.
It is an arithmetic number, because the mean of its divisors is an integer number (31409648208).
Almost surely, 2123021122101 is an apocalyptic number.
It is an amenable number.
123021122101 is a deficient number, since it is larger than the sum of its proper divisors (2617470731).
123021122101 is an equidigital number, since it uses as much as digits as its factorization.
123021122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2617470730.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 123021122101 its reverse (101221120321), we get a palindrome (224242242422).
The spelling of 123021122101 in words is "one hundred twenty-three billion, twenty-one million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •