Base | Representation |
---|---|
bin | 1001010011000100000001… |
… | …1011110101011010111111 |
3 | 1100012022121122021020211020 |
4 | 2110301000123311122333 |
5 | 2314443403404444012 |
6 | 33424232340555223 |
7 | 2103411012313302 |
oct | 224610033653277 |
9 | 40168548236736 |
10 | 10223103203007 |
11 | 3291659273622 |
12 | 11913806b2b13 |
13 | 59205aa2c206 |
14 | 274b2d6c4b39 |
15 | 12add67b0a8c |
hex | 94c406f56bf |
10223103203007 has 16 divisors (see below), whose sum is σ = 13868354178048. Its totient is φ = 6696854506080.
The previous prime is 10223103202993. The next prime is 10223103203021. The reversal of 10223103203007 is 70030230132201.
It is an interprime number because it is at equal distance from previous prime (10223103202993) and next prime (10223103203021).
It is not a de Polignac number, because 10223103203007 - 28 = 10223103202751 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223103203107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28235143 + ... + 28594920.
It is an arithmetic number, because the mean of its divisors is an integer number (866772136128).
Almost surely, 210223103203007 is an apocalyptic number.
10223103203007 is a deficient number, since it is larger than the sum of its proper divisors (3645250975041).
10223103203007 is an equidigital number, since it uses as much as digits as its factorization.
10223103203007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56831110.
The product of its (nonzero) digits is 1512, while the sum is 24.
Adding to 10223103203007 its reverse (70030230132201), we get a palindrome (80253333335208).
The spelling of 10223103203007 in words is "ten trillion, two hundred twenty-three billion, one hundred three million, two hundred three thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •