Base | Representation |
---|---|
bin | 1001101100011111110011… |
… | …10001111111110011000001 |
3 | 2210111011221100120122100020 |
4 | 10312033321301333303001 |
5 | 10243302043002320301 |
6 | 113202154100044053 |
7 | 4330220166102450 |
oct | 466177161776301 |
9 | 83434840518306 |
10 | 21320113323201 |
11 | 687a89a17a690 |
12 | 2483b92993629 |
13 | bb862a3b2944 |
14 | 539c82b8ab97 |
15 | 26e8b995e436 |
hex | 1363f9c7fcc1 |
21320113323201 has 128 divisors (see below), whose sum is σ = 37317378834432. Its totient is φ = 10503863136000.
The previous prime is 21320113323109. The next prime is 21320113323233. The reversal of 21320113323201 is 10232331102312.
It is not a de Polignac number, because 21320113323201 - 29 = 21320113322689 is a prime.
It is a super-2 number, since 2×213201133232012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21320113323701) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 336614106 + ... + 336677436.
It is an arithmetic number, because the mean of its divisors is an integer number (291542022144).
Almost surely, 221320113323201 is an apocalyptic number.
21320113323201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21320113323201 is a deficient number, since it is larger than the sum of its proper divisors (15997265511231).
21320113323201 is a wasteful number, since it uses less digits than its factorization.
21320113323201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64323.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 21320113323201 its reverse (10232331102312), we get a palindrome (31552444425513).
The spelling of 21320113323201 in words is "twenty-one trillion, three hundred twenty billion, one hundred thirteen million, three hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •