Base | Representation |
---|---|
bin | 11011110010011100000001… |
… | …100010100000110101101100 |
3 | 121000201110221102021110222222 |
4 | 123302130001202200311230 |
5 | 112004320334434413200 |
6 | 1111532005122454512 |
7 | 34512423001560563 |
oct | 3362340142406554 |
9 | 530643842243888 |
10 | 122213320232300 |
11 | 35a394181a3940 |
12 | 11859915804438 |
13 | 5326888814a6b |
14 | 2227228ac8bda |
15 | e1e0b01b2d85 |
hex | 6f27018a0d6c |
122213320232300 has 72 divisors (see below), whose sum is σ = 290334565440192. Its totient is φ = 44284171176000.
The previous prime is 122213320232257. The next prime is 122213320232309. The reversal of 122213320232300 is 3232023312221.
It is a self number, because there is not a number n which added to its sum of digits gives 122213320232300.
It is not an unprimeable number, because it can be changed into a prime (122213320232309) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 195983786 + ... + 196606385.
Almost surely, 2122213320232300 is an apocalyptic number.
122213320232300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122213320232300 is an abundant number, since it is smaller than the sum of its proper divisors (168121245207892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122213320232300 is a wasteful number, since it uses less digits than its factorization.
122213320232300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392590479 (or 392590472 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 122213320232300 its reverse (3232023312221), we get a palindrome (125445343544521).
The spelling of 122213320232300 in words is "one hundred twenty-two trillion, two hundred thirteen billion, three hundred twenty million, two hundred thirty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •