Base | Representation |
---|---|
bin | 10011000101010111101… |
… | …100110111110100010001 |
3 | 11122101001020222001222222 |
4 | 103011113230313310101 |
5 | 132441310204443113 |
6 | 2442244321310425 |
7 | 163514421345125 |
oct | 23052754676421 |
9 | 4571036861888 |
10 | 1311436406033 |
11 | 4661a4731326 |
12 | 1921b9495415 |
13 | 9688b56c0c0 |
14 | 4768c3b9585 |
15 | 241a7e69e08 |
hex | 13157b37d11 |
1311436406033 has 8 divisors (see below), whose sum is σ = 1412368473600. Its totient is φ = 1210511816208.
The previous prime is 1311436406009. The next prime is 1311436406069. The reversal of 1311436406033 is 3306046341131.
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-1311436406033 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1311436405984 and 1311436406002.
It is not an unprimeable number, because it can be changed into a prime (1311436406083) 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, 1502513 + ... + 2209166.
It is an arithmetic number, because the mean of its divisors is an integer number (176546059200).
Almost surely, 21311436406033 is an apocalyptic number.
1311436406033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1311436406033 is a deficient number, since it is larger than the sum of its proper divisors (100932067567).
1311436406033 is a wasteful number, since it uses less digits than its factorization.
1311436406033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3738871.
The product of its (nonzero) digits is 46656, while the sum is 35.
The spelling of 1311436406033 in words is "one trillion, three hundred eleven billion, four hundred thirty-six million, four hundred six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •