Base | Representation |
---|---|
bin | 10011001110011010… |
… | …00001110101010110 |
3 | 222122022112121110102 |
4 | 21213031001311112 |
5 | 132114234400342 |
6 | 4424103254102 |
7 | 513526323404 |
oct | 114715016526 |
9 | 28568477412 |
10 | 10321403222 |
11 | 4417188009 |
12 | 200074a332 |
13 | c864702b0 |
14 | 6dcb08474 |
15 | 4061e8832 |
hex | 267341d56 |
10321403222 has 48 divisors (see below), whose sum is σ = 18144024192. Its totient is φ = 4374021120.
The previous prime is 10321403179. The next prime is 10321403227. The reversal of 10321403222 is 22230412301.
10321403222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103214032222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10321403194 and 10321403203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10321403227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 291323 + ... + 324825.
It is an arithmetic number, because the mean of its divisors is an integer number (378000504).
Almost surely, 210321403222 is an apocalyptic number.
10321403222 is a deficient number, since it is larger than the sum of its proper divisors (7822620970).
10321403222 is a wasteful number, since it uses less digits than its factorization.
10321403222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33593 (or 33576 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10321403222 its reverse (22230412301), we get a palindrome (32551815523).
The spelling of 10321403222 in words is "ten billion, three hundred twenty-one million, four hundred three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •