Base | Representation |
---|---|
bin | 11011101111110100000111… |
… | …100010101111101111011000 |
3 | 121000002020120211210010022120 |
4 | 123233310013202233233120 |
5 | 111443342122234031300 |
6 | 1111313111235221240 |
7 | 34463411205646005 |
oct | 3357640742575730 |
9 | 530066524703276 |
10 | 122033032330200 |
11 | 35979a113a0642 |
12 | 1182a99b747820 |
13 | 531288634a154 |
14 | 221c6049888ac |
15 | e1955c58a3a0 |
hex | 6efd078afbd8 |
122033032330200 has 96 divisors (see below), whose sum is σ = 380841342786000. Its totient is φ = 32323738293760.
The previous prime is 122033032330199. The next prime is 122033032330229. The reversal of 122033032330200 is 2033230330221.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent 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 23 ways as a sum of consecutive naturals, for example, 682421967 + ... + 682600766.
Almost surely, 2122033032330200 is an apocalyptic number.
122033032330200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122033032330200 is an abundant number, since it is smaller than the sum of its proper divisors (258808310455800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122033032330200 is a wasteful number, since it uses less digits than its factorization.
122033032330200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365022901 (or 1365022892 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 122033032330200 its reverse (2033230330221), we get a palindrome (124066262660421).
The spelling of 122033032330200 in words is "one hundred twenty-two trillion, thirty-three billion, thirty-two million, three hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •