Base | Representation |
---|---|
bin | 11011110100000001010001… |
… | …001001110111101100100001 |
3 | 121001002212112121010120110111 |
4 | 123310001101021313230201 |
5 | 112013111004203211001 |
6 | 1112053544225131321 |
7 | 34523321636511640 |
oct | 3364012111675441 |
9 | 531085477116414 |
10 | 122322030132001 |
11 | 35a80533098557 |
12 | 118769b4489b41 |
13 | 5333bc19619bb |
14 | 222c5bc807357 |
15 | e21d23dc3851 |
hex | 6f4051277b21 |
122322030132001 has 8 divisors (see below), whose sum is σ = 143206279179264. Its totient is φ = 102290199413280.
The previous prime is 122322030131947. The next prime is 122322030132011. The reversal of 122322030132001 is 100231030223221.
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 122322030132001 - 29 = 122322030131489 is a prime.
It is a super-2 number, since 2×1223220301320012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122322030132011) 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, 213104581825 + ... + 213104582398.
It is an arithmetic number, because the mean of its divisors is an integer number (17900784897408).
Almost surely, 2122322030132001 is an apocalyptic number.
It is an amenable number.
122322030132001 is a deficient number, since it is larger than the sum of its proper divisors (20884249047263).
122322030132001 is an equidigital number, since it uses as much as digits as its factorization.
122322030132001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426209164271.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122322030132001 its reverse (100231030223221), we get a palindrome (222553060355222).
The spelling of 122322030132001 in words is "one hundred twenty-two trillion, three hundred twenty-two billion, thirty million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •