Base | Representation |
---|---|
bin | 11000011110100011… |
… | …10001111010011101 |
3 | 1020220211112012021200 |
4 | 30033101301322131 |
5 | 203403123033041 |
6 | 10011553550113 |
7 | 643436351505 |
oct | 141721617235 |
9 | 36824465250 |
10 | 13141221021 |
11 | 5633970945 |
12 | 2668b75339 |
13 | 1315718a36 |
14 | 8c940aa05 |
15 | 51da4a1b6 |
hex | 30f471e9d |
13141221021 has 12 divisors (see below), whose sum is σ = 18982757820. Its totient is φ = 8760355200.
The previous prime is 13141221019. The next prime is 13141221029. The reversal of 13141221021 is 12012214131.
It can be written as a sum of positive squares in 2 ways, for example, as 3272984100 + 9868236921 = 57210^2 + 99339^2 .
It is not a de Polignac number, because 13141221021 - 21 = 13141221019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13141220985 and 13141221003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13141221029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 312325 + ... + 351893.
It is an arithmetic number, because the mean of its divisors is an integer number (1581896485).
Almost surely, 213141221021 is an apocalyptic number.
It is an amenable number.
13141221021 is a deficient number, since it is larger than the sum of its proper divisors (5841536799).
13141221021 is a wasteful number, since it uses less digits than its factorization.
13141221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76476 (or 76473 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 13141221021 its reverse (12012214131), we get a palindrome (25153435152).
The spelling of 13141221021 in words is "thirteen billion, one hundred forty-one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •