Base | Representation |
---|---|
bin | 1011111010100001010100… |
… | …0110001101011101010010 |
3 | 1201101100101211001101000202 |
4 | 2332220111012031131102 |
5 | 3204112302033433242 |
6 | 43510020413415202 |
7 | 2521305213321512 |
oct | 276502506153522 |
9 | 51340354041022 |
10 | 13100004202322 |
11 | 41a0753946094 |
12 | 1576a50a9a502 |
13 | 74042c30982b |
14 | 33408785b842 |
15 | 17ab63e51932 |
hex | bea1518d752 |
13100004202322 has 8 divisors (see below), whose sum is σ = 19673042655756. Its totient is φ = 6542323317072.
The previous prime is 13100004202283. The next prime is 13100004202333. The reversal of 13100004202322 is 22320240000131.
13100004202322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 12504222449161 + 595781753161 = 3536131^2 + 771869^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×131000042023222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13100004202294 and 13100004202303.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3839389913 + ... + 3839393324.
Almost surely, 213100004202322 is an apocalyptic number.
13100004202322 is a deficient number, since it is larger than the sum of its proper divisors (6573038453434).
13100004202322 is an equidigital number, since it uses as much as digits as its factorization.
13100004202322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7678784092.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 13100004202322 its reverse (22320240000131), we get a palindrome (35420244202453).
The spelling of 13100004202322 in words is "thirteen trillion, one hundred billion, four million, two hundred two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •