Base | Representation |
---|---|
bin | 10011000100000010110… |
… | …100011101100010111101 |
3 | 11122020101000022121222110 |
4 | 103010002310131202331 |
5 | 132430401124112341 |
6 | 2441451130404233 |
7 | 163434220045335 |
oct | 23040264354275 |
9 | 4566330277873 |
10 | 1310012332221 |
11 | 46563389a61a |
12 | 191a80590679 |
13 | 966c2511b88 |
14 | 475951dc0c5 |
15 | 24122e1c216 |
hex | 13102d1d8bd |
1310012332221 has 16 divisors (see below), whose sum is σ = 1755641340288. Its totient is φ = 868862904000.
The previous prime is 1310012332219. The next prime is 1310012332243. The reversal of 1310012332221 is 1222332100131.
It is not a de Polignac number, because 1310012332221 - 21 = 1310012332219 is a prime.
It is a super-3 number, since 3×13100123322213 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310012332121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14227351 + ... + 14319131.
It is an arithmetic number, because the mean of its divisors is an integer number (109727583768).
Almost surely, 21310012332221 is an apocalyptic number.
It is an amenable number.
1310012332221 is a deficient number, since it is larger than the sum of its proper divisors (445629008067).
1310012332221 is a wasteful number, since it uses less digits than its factorization.
1310012332221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116132.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1310012332221 its reverse (1222332100131), we get a palindrome (2532344432352).
The spelling of 1310012332221 in words is "one trillion, three hundred ten billion, twelve million, three hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •