Base | Representation |
---|---|
bin | 11011111111010110111100… |
… | …100111011101000101011011 |
3 | 121010212100202211100021211202 |
4 | 123333112330213131011123 |
5 | 112113342300331130021 |
6 | 1113451530513544415 |
7 | 34633525020305066 |
oct | 3377267447350533 |
9 | 533770684307752 |
10 | 123101222130011 |
11 | 36250a31717394 |
12 | 11981a1227510b |
13 | 538c51aa0b558 |
14 | 22581b94378dd |
15 | e3722a541a0b |
hex | 6ff5bc9dd15b |
123101222130011 has 4 divisors (see below), whose sum is σ = 123101273955000. Its totient is φ = 123101170305024.
The previous prime is 123101222130001. The next prime is 123101222130043. The reversal of 123101222130011 is 110031222101321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123101222130011 - 210 = 123101222128987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123101222130001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22169261 + ... + 27160238.
It is an arithmetic number, because the mean of its divisors is an integer number (30775318488750).
Almost surely, 2123101222130011 is an apocalyptic number.
123101222130011 is a deficient number, since it is larger than the sum of its proper divisors (51824989).
123101222130011 is an equidigital number, since it uses as much as digits as its factorization.
123101222130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51824988.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 123101222130011 its reverse (110031222101321), we get a palindrome (233132444231332).
The spelling of 123101222130011 in words is "one hundred twenty-three trillion, one hundred one billion, two hundred twenty-two million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •