Base | Representation |
---|---|
bin | 11011110100001000111110… |
… | …110111110001000101001101 |
3 | 121001010122220212102200101101 |
4 | 123310020332313301011031 |
5 | 112013224440203043041 |
6 | 1112101434202543101 |
7 | 34524034126525135 |
oct | 3364107667610515 |
9 | 531118825380341 |
10 | 122330313331021 |
11 | 35a83aa3804584 |
12 | 11878526507a91 |
13 | 5334911a6c5b3 |
14 | 222cb6694dac5 |
15 | e2215b1aeb31 |
hex | 6f423edf114d |
122330313331021 has 8 divisors (see below), whose sum is σ = 123144689291904. Its totient is φ = 121515993178800.
The previous prime is 122330313331013. The next prime is 122330313331033. The reversal of 122330313331021 is 120133313033221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122330313331021 - 23 = 122330313331013 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 (122330313337021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9549046 + ... + 18326071.
It is an arithmetic number, because the mean of its divisors is an integer number (15393086161488).
Almost surely, 2122330313331021 is an apocalyptic number.
It is an amenable number.
122330313331021 is a deficient number, since it is larger than the sum of its proper divisors (814375960883).
122330313331021 is a wasteful number, since it uses less digits than its factorization.
122330313331021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27904331.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 122330313331021 its reverse (120133313033221), we get a palindrome (242463626364242).
The spelling of 122330313331021 in words is "one hundred twenty-two trillion, three hundred thirty billion, three hundred thirteen million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •