Base | Representation |
---|---|
bin | 1011110110100100011100… |
… | …0100000101101011001101 |
3 | 1201010212012001122112121112 |
4 | 2331221013010011223031 |
5 | 3202004241443431341 |
6 | 43414512532341405 |
7 | 2513353105013621 |
oct | 275510704055315 |
9 | 51125161575545 |
10 | 13032123030221 |
11 | 417498a781859 |
12 | 1565867774865 |
13 | 736c01b42ac9 |
14 | 330a883d3181 |
15 | 178ede876aeb |
hex | bda47105acd |
13032123030221 has 16 divisors (see below), whose sum is σ = 13458969722880. Its totient is φ = 12605681378160.
The previous prime is 13032123030217. The next prime is 13032123030229. The reversal of 13032123030221 is 12203032123031.
13032123030221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13032123030221 - 22 = 13032123030217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032123030229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 988548596 + ... + 988561778.
It is an arithmetic number, because the mean of its divisors is an integer number (841185607680).
Almost surely, 213032123030221 is an apocalyptic number.
It is an amenable number.
13032123030221 is a deficient number, since it is larger than the sum of its proper divisors (426846692659).
13032123030221 is a wasteful number, since it uses less digits than its factorization.
13032123030221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26096.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13032123030221 its reverse (12203032123031), we get a palindrome (25235155153252).
The spelling of 13032123030221 in words is "thirteen trillion, thirty-two billion, one hundred twenty-three million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •