Base | Representation |
---|---|
bin | 10001011101110010110… |
… | …111111100010001111000 |
3 | 11020201222121120221200012 |
4 | 101131302313330101320 |
5 | 124131024111034112 |
6 | 2315212551201052 |
7 | 152466435246554 |
oct | 21356267742170 |
9 | 4221877527605 |
10 | 1200223143032 |
11 | 423014746821 |
12 | 174740376188 |
13 | 892468b5bc4 |
14 | 4213c012864 |
15 | 213495b7022 |
hex | 11772dfc478 |
1200223143032 has 8 divisors (see below), whose sum is σ = 2250418393200. Its totient is φ = 600111571512.
The previous prime is 1200223143019. The next prime is 1200223143167. The reversal of 1200223143032 is 2303413220021.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×12002231430322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1200223142989 and 1200223143007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75013946432 + ... + 75013946447.
It is an arithmetic number, because the mean of its divisors is an integer number (281302299150).
Almost surely, 21200223143032 is an apocalyptic number.
It is an amenable number.
1200223143032 is a deficient number, since it is larger than the sum of its proper divisors (1050195250168).
1200223143032 is a wasteful number, since it uses less digits than its factorization.
1200223143032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150027892885 (or 150027892881 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 1200223143032 its reverse (2303413220021), we get a palindrome (3503636363053).
The spelling of 1200223143032 in words is "one trillion, two hundred billion, two hundred twenty-three million, one hundred forty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •