Base | Representation |
---|---|
bin | 101101101111111000111111… |
… | …011111010001110000100110 |
3 | 222101101211101012101121021110 |
4 | 231233320333133101300212 |
5 | 202333002423344042410 |
6 | 1551531232440325450 |
7 | 60244305314120142 |
oct | 5557707737216046 |
9 | 871354335347243 |
10 | 201203103112230 |
11 | 591228363975aa |
12 | 1a696614173886 |
13 | 88364a972136b |
14 | 37983d4316222 |
15 | 183db4b3da720 |
hex | b6fe3f7d1c26 |
201203103112230 has 32 divisors (see below), whose sum is σ = 490803635137248. Its totient is φ = 52774584422400.
The previous prime is 201203103112213. The next prime is 201203103112247. The reversal of 201203103112230 is 32211301302102.
It is an interprime number because it is at equal distance from previous prime (201203103112213) and next prime (201203103112247).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201203103112197 and 201203103112206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54973523611 + ... + 54973527270.
It is an arithmetic number, because the mean of its divisors is an integer number (15337613598039).
Almost surely, 2201203103112230 is an apocalyptic number.
201203103112230 is an abundant number, since it is smaller than the sum of its proper divisors (289600532025018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201203103112230 is a wasteful number, since it uses less digits than its factorization.
201203103112230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109947050952.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201203103112230 its reverse (32211301302102), we get a palindrome (233414404414332).
The spelling of 201203103112230 in words is "two hundred one trillion, two hundred three billion, one hundred three million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •