Base | Representation |
---|---|
bin | 11001000010010000… |
… | …01101001101011001 |
3 | 1021200201001100221212 |
4 | 30201020031031121 |
5 | 210011304420043 |
6 | 10101412512505 |
7 | 654034034666 |
oct | 144110151531 |
9 | 37621040855 |
10 | 13440701273 |
11 | 5777a1a88a |
12 | 273131b735 |
13 | 136279409c |
14 | 9170c6a6d |
15 | 539ea5018 |
hex | 32120d359 |
13440701273 has 4 divisors (see below), whose sum is σ = 13478777268. Its totient is φ = 13402625280.
The previous prime is 13440701191. The next prime is 13440701293. The reversal of 13440701273 is 37210704431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 37210704431 = 29 ⋅1283127739.
It can be written as a sum of positive squares in 2 ways, for example, as 1913887504 + 11526813769 = 43748^2 + 107363^2 .
It is a cyclic number.
It is not a de Polignac number, because 13440701273 - 210 = 13440700249 is a prime.
It is a super-3 number, since 3×134407012733 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13440701293) 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, 19037468 + ... + 19038173.
It is an arithmetic number, because the mean of its divisors is an integer number (3369694317).
Almost surely, 213440701273 is an apocalyptic number.
It is an amenable number.
13440701273 is a deficient number, since it is larger than the sum of its proper divisors (38075995).
13440701273 is an equidigital number, since it uses as much as digits as its factorization.
13440701273 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38075994.
The product of its (nonzero) digits is 14112, while the sum is 32.
The spelling of 13440701273 in words is "thirteen billion, four hundred forty million, seven hundred one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •