Base | Representation |
---|---|
bin | 1011110111000101100011… |
… | …1001101010100001000101 |
3 | 1201011201010120020021100110 |
4 | 2331301120321222201011 |
5 | 3202130443112101041 |
6 | 43422542554503233 |
7 | 2514116303625660 |
oct | 275613071524105 |
9 | 51151116207313 |
10 | 13041012222021 |
11 | 417873146a163 |
12 | 1567528734b19 |
13 | 7379ba666c04 |
14 | 33128cc026d7 |
15 | 17935ee66516 |
hex | bdc58e6a845 |
13041012222021 has 32 divisors (see below), whose sum is σ = 20192656619520. Its totient is φ = 7332032892096.
The previous prime is 13041012222011. The next prime is 13041012222037. The reversal of 13041012222021 is 12022221014031.
It is a happy number.
13041012222021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13041012222021 - 29 = 13041012221509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13041012222011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4343166 + ... + 6704111.
It is an arithmetic number, because the mean of its divisors is an integer number (631020519360).
Almost surely, 213041012222021 is an apocalyptic number.
It is an amenable number.
13041012222021 is a deficient number, since it is larger than the sum of its proper divisors (7151644397499).
13041012222021 is a wasteful number, since it uses less digits than its factorization.
13041012222021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11048193.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 13041012222021 its reverse (12022221014031), we get a palindrome (25063233236052).
The spelling of 13041012222021 in words is "thirteen trillion, forty-one billion, twelve million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •