Base | Representation |
---|---|
bin | 1001010001111010010011… |
… | …0010011000110100111001 |
3 | 1100010102112100121222122001 |
4 | 2110132210302120310321 |
5 | 2314132340333002223 |
6 | 33411200430501001 |
7 | 2102110404004015 |
oct | 224364462306471 |
9 | 40112470558561 |
10 | 10203312000313 |
11 | 3284222696063 |
12 | 1189578664761 |
13 | 59022569bba3 |
14 | 273bb3031545 |
15 | 12a62903a9ad |
hex | 947a4c98d39 |
10203312000313 has 8 divisors (see below), whose sum is σ = 10230504102080. Its totient is φ = 10176121322640.
The previous prime is 10203312000257. The next prime is 10203312000317. The reversal of 10203312000313 is 31300021330201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10203312000313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10203312000317) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14857183 + ... + 15528763.
It is an arithmetic number, because the mean of its divisors is an integer number (1278813012760).
Almost surely, 210203312000313 is an apocalyptic number.
It is an amenable number.
10203312000313 is a deficient number, since it is larger than the sum of its proper divisors (27192101767).
10203312000313 is an equidigital number, since it uses as much as digits as its factorization.
10203312000313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712047.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10203312000313 its reverse (31300021330201), we get a palindrome (41503333330514).
It can be divided in two parts, 1020331 and 2000313, that added together give a square (3020644 = 17382).
The spelling of 10203312000313 in words is "ten trillion, two hundred three billion, three hundred twelve million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •