Base | Representation |
---|---|
bin | 11001000011100010… |
… | …01110011000110001 |
3 | 1021201110021122221001 |
4 | 30201301032120301 |
5 | 210022033012001 |
6 | 10102435202001 |
7 | 654224321026 |
oct | 144161163061 |
9 | 37643248831 |
10 | 13451454001 |
11 | 5782aa4537 |
12 | 2734a46301 |
13 | 1364a8a44b |
14 | 9186c554d |
15 | 53adcb001 |
hex | 321c4e631 |
13451454001 has 4 divisors (see below), whose sum is σ = 13885371904. Its totient is φ = 13017536100.
The previous prime is 13451453993. The next prime is 13451454031. The reversal of 13451454001 is 10045415431.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10045415431 = 9461 ⋅1061771.
It is a cyclic number.
It is not a de Polignac number, because 13451454001 - 23 = 13451453993 is a prime.
It is a super-2 number, since 2×134514540012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13451454031) 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, 216958905 + ... + 216958966.
It is an arithmetic number, because the mean of its divisors is an integer number (3471342976).
Almost surely, 213451454001 is an apocalyptic number.
It is an amenable number.
13451454001 is a deficient number, since it is larger than the sum of its proper divisors (433917903).
13451454001 is an equidigital number, since it uses as much as digits as its factorization.
13451454001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433917902.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 13451454001 its reverse (10045415431), we get a palindrome (23496869432).
The spelling of 13451454001 in words is "thirteen billion, four hundred fifty-one million, four hundred fifty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •