Base | Representation |
---|---|
bin | 1001000110110110001010… |
… | …0111100111101010001011 |
3 | 1022110020212202020112000111 |
4 | 2101231202213213222023 |
5 | 2303024040132221303 |
6 | 33144002234415151 |
7 | 2052301002614245 |
oct | 221554247475213 |
9 | 38406782215014 |
10 | 10013223320203 |
11 | 321064757a224 |
12 | 11587682914b7 |
13 | 57832088ac4c |
14 | 2688dd3cb095 |
15 | 125700ca8b6d |
hex | 91b629e7a8b |
10013223320203 has 16 divisors (see below), whose sum is σ = 10469113574400. Its totient is φ = 9577151106600.
The previous prime is 10013223320201. The next prime is 10013223320209. The reversal of 10013223320203 is 30202332231001.
It is not a de Polignac number, because 10013223320203 - 21 = 10013223320201 is a prime.
It is a super-2 number, since 2×100132233202032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10013223320201) 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, 240386928 + ... + 240428578.
It is an arithmetic number, because the mean of its divisors is an integer number (654319598400).
Almost surely, 210013223320203 is an apocalyptic number.
10013223320203 is a deficient number, since it is larger than the sum of its proper divisors (455890254197).
10013223320203 is an frugal number, since it uses more digits than its factorization.
10013223320203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61479 (or 61433 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 10013223320203 its reverse (30202332231001), we get a palindrome (40215555551204).
The spelling of 10013223320203 in words is "ten trillion, thirteen billion, two hundred twenty-three million, three hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •