Base | Representation |
---|---|
bin | 10011001111010101001… |
… | …001100011001101100011 |
3 | 11200101122120202021012010 |
4 | 103033111021203031203 |
5 | 133130211014313103 |
6 | 2451213440004003 |
7 | 164343432106530 |
oct | 23172511431543 |
9 | 4611576667163 |
10 | 1322131010403 |
11 | 46a79253a935 |
12 | 1942a3000603 |
13 | 978a4129a78 |
14 | 47dc48add87 |
15 | 245d1cd1903 |
hex | 133d5263363 |
1322131010403 has 16 divisors (see below), whose sum is σ = 2014709656320. Its totient is φ = 755490747936.
The previous prime is 1322131010393. The next prime is 1322131010467. The reversal of 1322131010403 is 3040101312231.
It is not a de Polignac number, because 1322131010403 - 28 = 1322131010147 is a prime.
It is a super-3 number, since 3×13221310104033 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1322131010403.
It is not an unprimeable number, because it can be changed into a prime (1322131210403) 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, 833353 + ... + 1827221.
It is an arithmetic number, because the mean of its divisors is an integer number (125919353520).
Almost surely, 21322131010403 is an apocalyptic number.
1322131010403 is a deficient number, since it is larger than the sum of its proper divisors (692578645917).
1322131010403 is an equidigital number, since it uses as much as digits as its factorization.
1322131010403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1057226.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1322131010403 its reverse (3040101312231), we get a palindrome (4362232322634).
The spelling of 1322131010403 in words is "one trillion, three hundred twenty-two billion, one hundred thirty-one million, ten thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •