Base | Representation |
---|---|
bin | 101101101101011011110010… |
… | …110101010111011010110011 |
3 | 222100210200200221122101010112 |
4 | 231231123302311113122303 |
5 | 202322221233203114103 |
6 | 1551321515533451535 |
7 | 60226151456504525 |
oct | 5555336265273263 |
9 | 870720627571115 |
10 | 201034313332403 |
11 | 5906819aa167a1 |
12 | 1a669968940bab |
13 | 88235ba4295b5 |
14 | 37901812ada15 |
15 | 183956ce48cd8 |
hex | b6d6f2d576b3 |
201034313332403 has 2 divisors, whose sum is σ = 201034313332404. Its totient is φ = 201034313332402.
The previous prime is 201034313332397. The next prime is 201034313332409. The reversal of 201034313332403 is 304233313430102.
It is a balanced prime because it is at equal distance from previous prime (201034313332397) and next prime (201034313332409).
It is a cyclic number.
It is not a de Polignac number, because 201034313332403 - 214 = 201034313316019 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201034313332403.
It is not a weakly prime, because it can be changed into another prime (201034313332409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100517156666201 + 100517156666202.
It is an arithmetic number, because the mean of its divisors is an integer number (100517156666202).
Almost surely, 2201034313332403 is an apocalyptic number.
201034313332403 is a deficient number, since it is larger than the sum of its proper divisors (1).
201034313332403 is an equidigital number, since it uses as much as digits as its factorization.
201034313332403 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 201034313332403 its reverse (304233313430102), we get a palindrome (505267626762505).
The spelling of 201034313332403 in words is "two hundred one trillion, thirty-four billion, three hundred thirteen million, three hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •