Base | Representation |
---|---|
bin | 11001011011000101… |
… | …10111000111001001 |
3 | 1022020020000211000000 |
4 | 30231202313013021 |
5 | 210423121441431 |
6 | 10134213433213 |
7 | 662143500231 |
oct | 145542670711 |
9 | 38206024000 |
10 | 13649015241 |
11 | 5874571194 |
12 | 278b03b809 |
13 | 139699c6a4 |
14 | 936a30cc1 |
15 | 54d4029e6 |
hex | 32d8b71c9 |
13649015241 has 21 divisors (see below), whose sum is σ = 20468891901. Its totient is φ = 9097240572.
The previous prime is 13649015201. The next prime is 13649015257. The reversal of 13649015241 is 14251094631.
It is a happy number.
The square root of 13649015241 is 116829.
It is a perfect power (a square), and thus also a powerful number.
13649015241 is a `hidden beast` number, since 1 + 3 + 649 + 0 + 1 + 5 + 2 + 4 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-13649015241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13649015196 and 13649015205.
It is not an unprimeable number, because it can be changed into a prime (13649015201) by changing a digit.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 3152220 + ... + 3156546.
Almost surely, 213649015241 is an apocalyptic number.
13649015241 is the 116829-th square number.
13649015241 is the 58415-th centered octagonal number.
It is an amenable number.
13649015241 is a deficient number, since it is larger than the sum of its proper divisors (6819876660).
13649015241 is an frugal number, since it uses more digits than its factorization.
13649015241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8672 (or 4330 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
Multiplying 13649015241 by its sum of digits (36), we get a square (491364548676 = 7009742).
The spelling of 13649015241 in words is "thirteen billion, six hundred forty-nine million, fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •