Base | Representation |
---|---|
bin | 1011101010010000000… |
… | …0100010101100000010 |
3 | 201011001122121111200112 |
4 | 2322210000202230002 |
5 | 11240223421213442 |
6 | 232005322551322 |
7 | 20321055523301 |
oct | 2724400425402 |
9 | 634048544615 |
10 | 200320101122 |
11 | 77a56524989 |
12 | 329a6968542 |
13 | 15b7573741b |
14 | 99a4808438 |
15 | 5326604082 |
hex | 2ea4022b02 |
200320101122 has 16 divisors (see below), whose sum is σ = 314215941312. Its totient is φ = 95600105040.
The previous prime is 200320101089. The next prime is 200320101167. The reversal of 200320101122 is 221101023002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200320101097 and 200320101106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4641029 + ... + 4683992.
It is an arithmetic number, because the mean of its divisors is an integer number (19638496332).
Almost surely, 2200320101122 is an apocalyptic number.
200320101122 is a deficient number, since it is larger than the sum of its proper divisors (113895840190).
200320101122 is a wasteful number, since it uses less digits than its factorization.
200320101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9325513.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 200320101122 its reverse (221101023002), we get a palindrome (421421124124).
The spelling of 200320101122 in words is "two hundred billion, three hundred twenty million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •