Base | Representation |
---|---|
bin | 11011110011101111101011… |
… | …011001111101000011100010 |
3 | 121001001001210100001011122010 |
4 | 123303233223121331003202 |
5 | 112012303314124444132 |
6 | 1112041142140453350 |
7 | 34522052621331054 |
oct | 3363575331750342 |
9 | 531031710034563 |
10 | 122303143203042 |
11 | 35a735209a125a |
12 | 1187320324a256 |
13 | 53321a1a633a9 |
14 | 222b70a2a38d4 |
15 | e215bac216cc |
hex | 6f3beb67d0e2 |
122303143203042 has 8 divisors (see below), whose sum is σ = 244606286406096. Its totient is φ = 40767714401012.
The previous prime is 122303143203029. The next prime is 122303143203061. The reversal of 122303143203042 is 240302341303221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
122303143203042 is an admirable number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 10191928600248 + ... + 10191928600259.
It is an arithmetic number, because the mean of its divisors is an integer number (30575785800762).
Almost surely, 2122303143203042 is an apocalyptic number.
122303143203042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122303143203042 is a wasteful number, since it uses less digits than its factorization.
122303143203042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20383857200512.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 122303143203042 its reverse (240302341303221), we get a palindrome (362605484506263).
The spelling of 122303143203042 in words is "one hundred twenty-two trillion, three hundred three billion, one hundred forty-three million, two hundred three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •