Base | Representation |
---|---|
bin | 10011000100000010111… |
… | …000001111001101110110 |
3 | 11122020101002011220211201 |
4 | 103010002320033031312 |
5 | 132430401402301402 |
6 | 2441451203523114 |
7 | 163434231340312 |
oct | 23040270171566 |
9 | 4566332156751 |
10 | 1310013322102 |
11 | 465634406301 |
12 | 191a8098949a |
13 | 966c279a5c4 |
14 | 475953b8b42 |
15 | 24123065687 |
hex | 13102e0f376 |
1310013322102 has 8 divisors (see below), whose sum is σ = 1991938065336. Its totient is φ = 646033966992.
The previous prime is 1310013322087. The next prime is 1310013322139. The reversal of 1310013322102 is 2012233100131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×13100133221023 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1310013322102.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4486346848 + ... + 4486347139.
It is an arithmetic number, because the mean of its divisors is an integer number (248992258167).
Almost surely, 21310013322102 is an apocalyptic number.
1310013322102 is a deficient number, since it is larger than the sum of its proper divisors (681924743234).
1310013322102 is an equidigital number, since it uses as much as digits as its factorization.
1310013322102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8972694062.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1310013322102 its reverse (2012233100131), we get a palindrome (3322246422233).
The spelling of 1310013322102 in words is "one trillion, three hundred ten billion, thirteen million, three hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •