Base | Representation |
---|---|
bin | 101101001010000101010… |
… | …100000111111110101001 |
3 | 101222122220112222112221201 |
4 | 231022011110013332221 |
5 | 401320324434024001 |
6 | 10333331454404201 |
7 | 440125156364161 |
oct | 55120524077651 |
9 | 11878815875851 |
10 | 3103203033001 |
11 | a97074236995 |
12 | 421508500661 |
13 | 196827b00836 |
14 | aa2a54d15a1 |
15 | 55ac4c7a501 |
hex | 2d285507fa9 |
3103203033001 has 16 divisors (see below), whose sum is σ = 3162662997120. Its totient is φ = 3044299040640.
The previous prime is 3103203032987. The next prime is 3103203033017. The reversal of 3103203033001 is 1003303023013.
3103203033001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3103203033001 - 231 = 3101055549353 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3103203033001.
It is not an unprimeable number, because it can be changed into a prime (3103203033401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64415215 + ... + 64463371.
It is an arithmetic number, because the mean of its divisors is an integer number (197666437320).
Almost surely, 23103203033001 is an apocalyptic number.
It is an amenable number.
3103203033001 is a deficient number, since it is larger than the sum of its proper divisors (59459964119).
3103203033001 is a wasteful number, since it uses less digits than its factorization.
3103203033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53904.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 3103203033001 its reverse (1003303023013), we get a palindrome (4106506056014).
The spelling of 3103203033001 in words is "three trillion, one hundred three billion, two hundred three million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •