Base | Representation |
---|---|
bin | 11001011000110101… |
… | …01000100111011101 |
3 | 1022011220101212210101 |
4 | 30230122220213131 |
5 | 210403300102001 |
6 | 10132255541101 |
7 | 661523531641 |
oct | 145432504735 |
9 | 38156355711 |
10 | 13630081501 |
11 | 5864909a73 |
12 | 278482a791 |
13 | 1392aa06aa |
14 | 934302c21 |
15 | 54b912a01 |
hex | 32c6a89dd |
13630081501 has 4 divisors (see below), whose sum is σ = 13631097532. Its totient is φ = 13629065472.
The previous prime is 13630081469. The next prime is 13630081513. The reversal of 13630081501 is 10518003631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10518003631 = 21929 ⋅479639.
It can be written as a sum of positive squares in 2 ways, for example, as 7141940100 + 6488141401 = 84510^2 + 80549^2 .
It is a cyclic number.
It is not a de Polignac number, because 13630081501 - 25 = 13630081469 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 13630081501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13630081541) 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, 487620 + ... + 514813.
It is an arithmetic number, because the mean of its divisors is an integer number (3407774383).
Almost surely, 213630081501 is an apocalyptic number.
It is an amenable number.
13630081501 is a deficient number, since it is larger than the sum of its proper divisors (1016031).
13630081501 is a wasteful number, since it uses less digits than its factorization.
13630081501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1016030.
The product of its (nonzero) digits is 2160, while the sum is 28.
The spelling of 13630081501 in words is "thirteen billion, six hundred thirty million, eighty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •