Base | Representation |
---|---|
bin | 10011000010011110… |
… | …01011011000011011 |
3 | 222101100012000012202 |
4 | 21201033023120123 |
5 | 131413123201243 |
6 | 4410130000415 |
7 | 511202434100 |
oct | 114117133033 |
9 | 28340160182 |
10 | 10221303323 |
11 | 4375728520 |
12 | 1b9311610b |
13 | c6b7c319a |
14 | 6cd6ccaa7 |
15 | 3ec5244b8 |
hex | 2613cb61b |
10221303323 has 48 divisors (see below), whose sum is σ = 13161035520. Its totient is φ = 7848792000.
The previous prime is 10221303271. The next prime is 10221303359. The reversal of 10221303323 is 32330312201.
10221303323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10221303323 - 26 = 10221303259 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10221303295 and 10221303304.
It is not an unprimeable number, because it can be changed into a prime (10221303383) 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 47 ways as a sum of consecutive naturals, for example, 19543340 + ... + 19543862.
It is an arithmetic number, because the mean of its divisors is an integer number (274188240).
Almost surely, 210221303323 is an apocalyptic number.
10221303323 is a deficient number, since it is larger than the sum of its proper divisors (2939732197).
10221303323 is a wasteful number, since it uses less digits than its factorization.
10221303323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008 (or 1001 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10221303323 its reverse (32330312201), we get a palindrome (42551615524).
The spelling of 10221303323 in words is "ten billion, two hundred twenty-one million, three hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •