Base | Representation |
---|---|
bin | 10011000001100000… |
… | …11000011010001101 |
3 | 222100202222211222222 |
4 | 21200300120122031 |
5 | 131404041331341 |
6 | 4405240545125 |
7 | 511044011255 |
oct | 114060303215 |
9 | 28322884888 |
10 | 10213230221 |
11 | 4371114037 |
12 | 1b904821a5 |
13 | c69c276bc |
14 | 6cc5ca965 |
15 | 3eb97c44b |
hex | 260c1868d |
10213230221 has 8 divisors (see below), whose sum is σ = 10413446400. Its totient is φ = 10013292432.
The previous prime is 10213230149. The next prime is 10213230239. The reversal of 10213230221 is 12203231201.
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 10213230221 - 210 = 10213229197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10213230221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213230241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5276 + ... + 143018.
It is an arithmetic number, because the mean of its divisors is an integer number (1301680800).
Almost surely, 210213230221 is an apocalyptic number.
It is an amenable number.
10213230221 is a deficient number, since it is larger than the sum of its proper divisors (200216179).
10213230221 is a wasteful number, since it uses less digits than its factorization.
10213230221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139195.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10213230221 its reverse (12203231201), we get a palindrome (22416461422).
The spelling of 10213230221 in words is "ten billion, two hundred thirteen million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •