Base | Representation |
---|---|
bin | 1001000110001101100001… |
… | …0101010001111000010011 |
3 | 1022102012201102011012001002 |
4 | 2101203120111101320103 |
5 | 2302334214202301003 |
6 | 33134555503332215 |
7 | 2051433435302312 |
oct | 221433025217023 |
9 | 38365642135032 |
10 | 10002313322003 |
11 | 3206a59124092 |
12 | 11566225b106b |
13 | 5772a24b6302 |
14 | 268186468279 |
15 | 1252b3096a88 |
hex | 918d8551e13 |
10002313322003 has 12 divisors (see below), whose sum is σ = 10240615134288. Its totient is φ = 9769433975280.
The previous prime is 10002313321963. The next prime is 10002313322021. The reversal of 10002313322003 is 30022331320001.
It is not a de Polignac number, because 10002313322003 - 26 = 10002313321939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10002313328003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 121218026 + ... + 121300512.
It is an arithmetic number, because the mean of its divisors is an integer number (853384594524).
Almost surely, 210002313322003 is an apocalyptic number.
10002313322003 is a deficient number, since it is larger than the sum of its proper divisors (238301812285).
10002313322003 is an frugal number, since it uses more digits than its factorization.
10002313322003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148154 (or 148111 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10002313322003 its reverse (30022331320001), we get a palindrome (40024644642004).
It can be divided in two parts, 1000231 and 3322003, that added together give a palindrome (4322234).
The spelling of 10002313322003 in words is "ten trillion, two billion, three hundred thirteen million, three hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •