Base | Representation |
---|---|
bin | 1011000000111010000001… |
… | …0110011000101011011001 |
3 | 1120212201112212112002021210 |
4 | 2300032200112120223121 |
5 | 3041403143433431413 |
6 | 41431203411253333 |
7 | 2356635056220600 |
oct | 260164026305331 |
9 | 46781485462253 |
10 | 12110203030233 |
11 | 39499a99975a0 |
12 | 14370565aa249 |
13 | 69acaac95109 |
14 | 2dc1cbb32a37 |
15 | 160032c703c3 |
hex | b03a0598ad9 |
12110203030233 has 48 divisors (see below), whose sum is σ = 20570464327104. Its totient is φ = 6266535690240.
The previous prime is 12110203030229. The next prime is 12110203030301. The reversal of 12110203030233 is 33203030201121.
It is not a de Polignac number, because 12110203030233 - 22 = 12110203030229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (12110203030033) 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 47 ways as a sum of consecutive naturals, for example, 14155060 + ... + 14986197.
It is an arithmetic number, because the mean of its divisors is an integer number (428551340148).
Almost surely, 212110203030233 is an apocalyptic number.
It is an amenable number.
12110203030233 is a deficient number, since it is larger than the sum of its proper divisors (8460261296871).
12110203030233 is a wasteful number, since it uses less digits than its factorization.
12110203030233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29141542 (or 29141535 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12110203030233 its reverse (33203030201121), we get a palindrome (45313233231354).
The spelling of 12110203030233 in words is "twelve trillion, one hundred ten billion, two hundred three million, thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •