Base | Representation |
---|---|
bin | 1011110110100100101110… |
… | …1001110010000000110101 |
3 | 1201010212101102112000202121 |
4 | 2331221023221302000311 |
5 | 3202004421201120041 |
6 | 43414524322435541 |
7 | 2513355031301650 |
oct | 275511351620065 |
9 | 51125342460677 |
10 | 13032200020021 |
11 | 4174a1a187396 |
12 | 1565889502bb1 |
13 | 736c14a8acc0 |
14 | 330a94714897 |
15 | 178ee64d37d1 |
hex | bda4ba72035 |
13032200020021 has 16 divisors (see below), whose sum is σ = 16181574441984. Its totient is φ = 10219941736704.
The previous prime is 13032200020013. The next prime is 13032200020051. The reversal of 13032200020021 is 12002000223031.
13032200020021 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 13032200020021 - 23 = 13032200020013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13032200019977 and 13032200020004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032200020001) 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, 633666661 + ... + 633687226.
It is an arithmetic number, because the mean of its divisors is an integer number (1011348402624).
Almost surely, 213032200020021 is an apocalyptic number.
It is an amenable number.
13032200020021 is a deficient number, since it is larger than the sum of its proper divisors (3149374421963).
13032200020021 is a wasteful number, since it uses less digits than its factorization.
13032200020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1267354020.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 13032200020021 its reverse (12002000223031), we get a palindrome (25034200243052).
The spelling of 13032200020021 in words is "thirteen trillion, thirty-two billion, two hundred million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •