Base | Representation |
---|---|
bin | 11001000011001000… |
… | …11101000100101001 |
3 | 1021201012222120201102 |
4 | 30201210131010221 |
5 | 210020203400111 |
6 | 10102235331145 |
7 | 654154005641 |
oct | 144144350451 |
9 | 37635876642 |
10 | 13448106281 |
11 | 5781118325 |
12 | 27338b0ab5 |
13 | 136418774c |
14 | 918093521 |
15 | 53a96913b |
hex | 32191d129 |
13448106281 has 4 divisors (see below), whose sum is σ = 13452186000. Its totient is φ = 13444026564.
The previous prime is 13448106239. The next prime is 13448106289. The reversal of 13448106281 is 18260184431.
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: 18260184431 = 12323 ⋅1481797.
It is a cyclic number.
It is not a de Polignac number, because 13448106281 - 226 = 13380997417 is a prime.
It is a super-3 number, since 3×134481062813 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13448106289) 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, 2034911 + ... + 2041508.
It is an arithmetic number, because the mean of its divisors is an integer number (3363046500).
Almost surely, 213448106281 is an apocalyptic number.
It is an amenable number.
13448106281 is a deficient number, since it is larger than the sum of its proper divisors (4079719).
13448106281 is an equidigital number, since it uses as much as digits as its factorization.
13448106281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4079718.
The product of its (nonzero) digits is 36864, while the sum is 38.
The spelling of 13448106281 in words is "thirteen billion, four hundred forty-eight million, one hundred six thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •