Base | Representation |
---|---|
bin | 11100000010100100101011… |
… | …001010010101100100000101 |
3 | 121011122110221120211211222101 |
4 | 130002210223022111210011 |
5 | 112131002200221200401 |
6 | 1114141222212032101 |
7 | 34655505046131436 |
oct | 3402445312254405 |
9 | 534573846754871 |
10 | 123322120100101 |
11 | 3632668788284a |
12 | 119b87a0602631 |
13 | 53a72c276aab0 |
14 | 2264b72b8d48d |
15 | e3cd584ac101 |
hex | 70292b295905 |
123322120100101 has 16 divisors (see below), whose sum is σ = 133639383439296. Its totient is φ = 113123732426496.
The previous prime is 123322120100041. The next prime is 123322120100147. The reversal of 123322120100101 is 101001021223321.
It is a cyclic number.
It is not a de Polignac number, because 123322120100101 - 27 = 123322120099973 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 (123322120100701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14013126 + ... + 21047848.
It is an arithmetic number, because the mean of its divisors is an integer number (8352461464956).
Almost surely, 2123322120100101 is an apocalyptic number.
It is an amenable number.
123322120100101 is a deficient number, since it is larger than the sum of its proper divisors (10317263339195).
123322120100101 is a wasteful number, since it uses less digits than its factorization.
123322120100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7043172.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 123322120100101 its reverse (101001021223321), we get a palindrome (224323141323422).
The spelling of 123322120100101 in words is "one hundred twenty-three trillion, three hundred twenty-two billion, one hundred twenty million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.257 sec. • engine limits •