Base | Representation |
---|---|
bin | 1011101101100100111… |
… | …1110100110111111111 |
3 | 201020100220022201111201 |
4 | 2323121033310313333 |
5 | 11244041101101343 |
6 | 232234111200331 |
7 | 20352152555305 |
oct | 2733117646777 |
9 | 636326281451 |
10 | 201213300223 |
11 | 78374731661 |
12 | 32bb5b160a7 |
13 | 15c887bc3c0 |
14 | 9a4b2b4275 |
15 | 5379c3a94d |
hex | 2ed93f4dff |
201213300223 has 8 divisors (see below), whose sum is σ = 216713270816. Its totient is φ = 185716476000.
The previous prime is 201213300217. The next prime is 201213300241. The reversal of 201213300223 is 322003312102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201213300223 - 229 = 200676429311 is a prime.
It is a super-2 number, since 2×2012133002232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201213300223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201213300283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 652923 + ... + 910348.
It is an arithmetic number, because the mean of its divisors is an integer number (27089158852).
Almost surely, 2201213300223 is an apocalyptic number.
201213300223 is a deficient number, since it is larger than the sum of its proper divisors (15499970593).
201213300223 is a wasteful number, since it uses less digits than its factorization.
201213300223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573185.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 201213300223 its reverse (322003312102), we get a palindrome (523216612325).
The spelling of 201213300223 in words is "two hundred one billion, two hundred thirteen million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •