Base | Representation |
---|---|
bin | 111001011000010101… |
… | …1101100110110011000 |
3 | 102210001122102202021110 |
4 | 1302300223230312120 |
5 | 4004330133031300 |
6 | 132335155340320 |
7 | 11621406011355 |
oct | 1626053546630 |
9 | 383048382243 |
10 | 123223330200 |
11 | 482933a2883 |
12 | 1ba6b2b16a0 |
13 | b809c34049 |
14 | 5d6d48562c |
15 | 3312e61550 |
hex | 1cb0aecd98 |
123223330200 has 96 divisors (see below), whose sum is σ = 386284539600. Its totient is φ = 32490332160.
The previous prime is 123223330199. The next prime is 123223330207. The reversal of 123223330200 is 2033322321.
123223330200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123223330207) 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, 1100377 + ... + 1207176.
Almost surely, 2123223330200 is an apocalyptic number.
123223330200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123223330200 is an abundant number, since it is smaller than the sum of its proper divisors (263061209400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123223330200 is a wasteful number, since it uses less digits than its factorization.
123223330200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2307661 (or 2307652 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 123223330200 its reverse (2033322321), we get a palindrome (125256652521).
The spelling of 123223330200 in words is "one hundred twenty-three billion, two hundred twenty-three million, three hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •