Base | Representation |
---|---|
bin | 11011111110101000010001… |
… | …110001000011011011111001 |
3 | 121010200120102111121022200210 |
4 | 123332220101301003123321 |
5 | 112112032133420232301 |
6 | 1113412522224421333 |
7 | 34630102146510102 |
oct | 3376502161033371 |
9 | 533616374538623 |
10 | 123051111102201 |
11 | 36231757310517 |
12 | 11974168177849 |
13 | 5387892c666c9 |
14 | 22559c40853a9 |
15 | e35c96069ad6 |
hex | 6fea11c436f9 |
123051111102201 has 4 divisors (see below), whose sum is σ = 164068148136272. Its totient is φ = 82034074068132.
The previous prime is 123051111102187. The next prime is 123051111102217. The reversal of 123051111102201 is 102201111150321.
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 not a de Polignac number, because 123051111102201 - 211 = 123051111100153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123051111102301) 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, 20508518517031 + ... + 20508518517036.
It is an arithmetic number, because the mean of its divisors is an integer number (41017037034068).
Almost surely, 2123051111102201 is an apocalyptic number.
It is an amenable number.
123051111102201 is a deficient number, since it is larger than the sum of its proper divisors (41017037034071).
123051111102201 is an equidigital number, since it uses as much as digits as its factorization.
123051111102201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41017037034070.
The product of its (nonzero) digits is 120, while the sum is 21.
Adding to 123051111102201 its reverse (102201111150321), we get a palindrome (225252222252522).
The spelling of 123051111102201 in words is "one hundred twenty-three trillion, fifty-one billion, one hundred eleven million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •