Base | Representation |
---|---|
bin | 1100000111111111010101… |
… | …0111010001111101101101 |
3 | 1202012110200012010212122012 |
4 | 3001333311113101331231 |
5 | 3221410201402242201 |
6 | 44204205521331005 |
7 | 2544106343434040 |
oct | 301776527217555 |
9 | 52173605125565 |
10 | 13331400040301 |
11 | 427a8a6857022 |
12 | 15b386aa96a65 |
13 | 7591b7c43015 |
14 | 3413594d4c57 |
15 | 181ba88215bb |
hex | c1ff55d1f6d |
13331400040301 has 8 divisors (see below), whose sum is σ = 15523355303424. Its totient is φ = 11211312162960.
The previous prime is 13331400040297. The next prime is 13331400040339. The reversal of 13331400040301 is 10304000413331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13331400040301 - 22 = 13331400040297 is a prime.
It is a super-3 number, since 3×133314000403013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331400040801) 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, 17966846045 + ... + 17966846786.
It is an arithmetic number, because the mean of its divisors is an integer number (1940419412928).
Almost surely, 213331400040301 is an apocalyptic number.
It is an amenable number.
13331400040301 is a deficient number, since it is larger than the sum of its proper divisors (2191955263123).
13331400040301 is an equidigital number, since it uses as much as digits as its factorization.
13331400040301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35933692891.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13331400040301 its reverse (10304000413331), we get a palindrome (23635400453632).
The spelling of 13331400040301 in words is "thirteen trillion, three hundred thirty-one billion, four hundred million, forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •