Base | Representation |
---|---|
bin | 111001000001010011… |
… | …0100011101101110101 |
3 | 102201001202201012100122 |
4 | 1302002212203231311 |
5 | 4001234224331013 |
6 | 132130341221325 |
7 | 11563300532330 |
oct | 1620246435565 |
9 | 381052635318 |
10 | 122450230133 |
11 | 47a26a65300 |
12 | 1b894401845 |
13 | b715a0c09a |
14 | 5cd891d617 |
15 | 32ba14ea08 |
hex | 1c829a3b75 |
122450230133 has 24 divisors (see below), whose sum is σ = 154511798784. Its totient is φ = 94987743840.
The previous prime is 122450230129. The next prime is 122450230157. The reversal of 122450230133 is 331032054221.
It is a happy number.
It is not a de Polignac number, because 122450230133 - 22 = 122450230129 is a prime.
It is a super-2 number, since 2×1224502301332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122450230103) 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 23 ways as a sum of consecutive naturals, for example, 135266 + ... + 513027.
It is an arithmetic number, because the mean of its divisors is an integer number (6437991616).
Almost surely, 2122450230133 is an apocalyptic number.
It is an amenable number.
122450230133 is a deficient number, since it is larger than the sum of its proper divisors (32061568651).
122450230133 is a wasteful number, since it uses less digits than its factorization.
122450230133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648545 (or 648534 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 122450230133 its reverse (331032054221), we get a palindrome (453482284354).
The spelling of 122450230133 in words is "one hundred twenty-two billion, four hundred fifty million, two hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •