Base | Representation |
---|---|
bin | 1011110110110001000010… |
… | …1011001100000010001101 |
3 | 1201011011220210100211021011 |
4 | 2331230100223030002031 |
5 | 3202033203402002201 |
6 | 43420232322405221 |
7 | 2513532656360464 |
oct | 275542053140215 |
9 | 51134823324234 |
10 | 13035505500301 |
11 | 4176366024679 |
12 | 1566450500811 |
13 | 73732083b8ab |
14 | 330cc97199db |
15 | 17913b7ba151 |
hex | bdb10acc08d |
13035505500301 has 4 divisors (see below), whose sum is σ = 13036824492832. Its totient is φ = 13034186507772.
The previous prime is 13035505500293. The next prime is 13035505500317. The reversal of 13035505500301 is 10300550553031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13035505500301 - 23 = 13035505500293 is a prime.
It is a super-2 number, since 2×130355055003012 (a number of 27 digits) contains 22 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 (13035505500001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 659481441 + ... + 659501206.
It is an arithmetic number, because the mean of its divisors is an integer number (3259206123208).
Almost surely, 213035505500301 is an apocalyptic number.
It is an amenable number.
13035505500301 is a deficient number, since it is larger than the sum of its proper divisors (1318992531).
13035505500301 is an equidigital number, since it uses as much as digits as its factorization.
13035505500301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1318992530.
The product of its (nonzero) digits is 16875, while the sum is 31.
The spelling of 13035505500301 in words is "thirteen trillion, thirty-five billion, five hundred five million, five hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •