Base | Representation |
---|---|
bin | 11011110010010001110001… |
… | …111111101100111011101001 |
3 | 121000200102112221012221011122 |
4 | 123302101301333230323221 |
5 | 112004130323414432223 |
6 | 1111522545521105025 |
7 | 34511553313444010 |
oct | 3362216177547351 |
9 | 530612487187148 |
10 | 122202322030313 |
11 | 35a34793a83a08 |
12 | 11857766488175 |
13 | 5325825099935 |
14 | 22268a4165a77 |
15 | e1db6987b5c8 |
hex | 6f2471fecee9 |
122202322030313 has 32 divisors (see below), whose sum is σ = 141559195041792. Its totient is φ = 103331754144000.
The previous prime is 122202322030307. The next prime is 122202322030339. The reversal of 122202322030313 is 313030223202221.
It is a cyclic number.
It is not a de Polignac number, because 122202322030313 - 212 = 122202322026217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (122202322330313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 119208620 + ... + 120229362.
It is an arithmetic number, because the mean of its divisors is an integer number (4423724845056).
Almost surely, 2122202322030313 is an apocalyptic number.
It is an amenable number.
122202322030313 is a deficient number, since it is larger than the sum of its proper divisors (19356873011479).
122202322030313 is a wasteful number, since it uses less digits than its factorization.
122202322030313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021685.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 122202322030313 its reverse (313030223202221), we get a palindrome (435232545232534).
The spelling of 122202322030313 in words is "one hundred twenty-two trillion, two hundred two billion, three hundred twenty-two million, thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •