Base | Representation |
---|---|
bin | 11100000001000111011100… |
… | …110000000001011000000011 |
3 | 121011021220120110110201021012 |
4 | 130001013130300001120003 |
5 | 112122332144201043021 |
6 | 1114023225322351135 |
7 | 34645332351132110 |
oct | 3401073460013003 |
9 | 534256513421235 |
10 | 123222020331011 |
11 | 362981900a3758 |
12 | 119a130535b4ab |
13 | 539aa2c3989b4 |
14 | 225dd9879b907 |
15 | e3a44a61635b |
hex | 7011dcc01603 |
123222020331011 has 8 divisors (see below), whose sum is σ = 140825450791680. Its totient is φ = 105618661045128.
The previous prime is 123222020330999. The next prime is 123222020331061. The reversal of 123222020331011 is 110133020222321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123222020331011 - 230 = 123220946589187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123222020331061) 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 7 ways as a sum of consecutive naturals, for example, 14030801 + ... + 21054866.
It is an arithmetic number, because the mean of its divisors is an integer number (17603181348960).
Almost surely, 2123222020331011 is an apocalyptic number.
123222020331011 is a deficient number, since it is larger than the sum of its proper divisors (17603430460669).
123222020331011 is an equidigital number, since it uses as much as digits as its factorization.
123222020331011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35587393.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 123222020331011 its reverse (110133020222321), we get a palindrome (233355040553332).
The spelling of 123222020331011 in words is "one hundred twenty-three trillion, two hundred twenty-two billion, twenty million, three hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •