Base | Representation |
---|---|
bin | 11001000100110000… |
… | …01000101111011111 |
3 | 1021202011110220101010 |
4 | 30202120020233133 |
5 | 210032140420440 |
6 | 10103441550303 |
7 | 654410114052 |
oct | 144230105737 |
9 | 37664426333 |
10 | 13461654495 |
11 | 57888312a3 |
12 | 2738345393 |
13 | 1366c1c343 |
14 | 919bbca99 |
15 | 53bc43580 |
hex | 322608bdf |
13461654495 has 32 divisors (see below), whose sum is σ = 21671884800. Its totient is φ = 7135223040.
The previous prime is 13461654469. The next prime is 13461654497. The reversal of 13461654495 is 59445616431.
It is a happy number.
13461654495 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13461654495 - 212 = 13461650399 is a prime.
It is a super-2 number, since 2×134616544952 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13461654497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3272490 + ... + 3276600.
It is an arithmetic number, because the mean of its divisors is an integer number (677246400).
Almost surely, 213461654495 is an apocalyptic number.
13461654495 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13461654495 is a deficient number, since it is larger than the sum of its proper divisors (8210230305).
13461654495 is a wasteful number, since it uses less digits than its factorization.
13461654495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5415.
The product of its digits is 1555200, while the sum is 48.
The spelling of 13461654495 in words is "thirteen billion, four hundred sixty-one million, six hundred fifty-four thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •