Base | Representation |
---|---|
bin | 11001110110001101… |
… | …00000001000000001 |
3 | 1022211002000022102001 |
4 | 30323012200020001 |
5 | 211404333241311 |
6 | 10212540424001 |
7 | 1000604660446 |
oct | 147306401001 |
9 | 38732008361 |
10 | 13876462081 |
11 | 59809a0389 |
12 | 2833248001 |
13 | 1401b46811 |
14 | 958d199cd |
15 | 56337e4c1 |
hex | 33b1a0201 |
13876462081 has 4 divisors (see below), whose sum is σ = 13879722964. Its totient is φ = 13873201200.
The previous prime is 13876462073. The next prime is 13876462133. The reversal of 13876462081 is 18026467831.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18026467831 = 29 ⋅621602339.
It can be written as a sum of positive squares in 2 ways, for example, as 13353882481 + 522579600 = 115559^2 + 22860^2 .
It is a cyclic number.
It is not a de Polignac number, because 13876462081 - 23 = 13876462073 is a prime.
It is a super-2 number, since 2×138764620812 (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 (13876462181) 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, 1624050 + ... + 1632571.
It is an arithmetic number, because the mean of its divisors is an integer number (3469930741).
Almost surely, 213876462081 is an apocalyptic number.
It is an amenable number.
13876462081 is a deficient number, since it is larger than the sum of its proper divisors (3260883).
13876462081 is an equidigital number, since it uses as much as digits as its factorization.
13876462081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3260882.
The product of its (nonzero) digits is 387072, while the sum is 46.
The spelling of 13876462081 in words is "thirteen billion, eight hundred seventy-six million, four hundred sixty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •