Base | Representation |
---|---|
bin | 11001100000001001… |
… | …11100110101010001 |
3 | 1022100011222120100212 |
4 | 30300010330311101 |
5 | 211020011143001 |
6 | 10142332253505 |
7 | 663200611055 |
oct | 146004746521 |
9 | 38304876325 |
10 | 13691506001 |
11 | 5896553118 |
12 | 27a1311295 |
13 | 13a2728b54 |
14 | 93c531c65 |
15 | 551ee77bb |
hex | 33013cd51 |
13691506001 has 4 divisors (see below), whose sum is σ = 14412111600. Its totient is φ = 12970900404.
The previous prime is 13691505979. The next prime is 13691506007. The reversal of 13691506001 is 10060519631.
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 13691506001 - 230 = 12617764177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13691506007) 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, 360302771 + ... + 360302808.
It is an arithmetic number, because the mean of its divisors is an integer number (3603027900).
Almost surely, 213691506001 is an apocalyptic number.
It is an amenable number.
13691506001 is a deficient number, since it is larger than the sum of its proper divisors (720605599).
13691506001 is an equidigital number, since it uses as much as digits as its factorization.
13691506001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720605598.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 13691506001 in words is "thirteen billion, six hundred ninety-one million, five hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •