Base | Representation |
---|---|
bin | 10111010001000111001100… |
… | …000110001110101100011001 |
3 | 111102022202020201201022012211 |
4 | 113101013030012032230121 |
5 | 101403042412110343223 |
6 | 1001350115511235121 |
7 | 30361113033262441 |
oct | 2721071406165431 |
9 | 442282221638184 |
10 | 102331020012313 |
11 | 2a67338403a674 |
12 | b58852b678aa1 |
13 | 4513a09cc7091 |
14 | 1b3abc24c9121 |
15 | bc6ce83bad0d |
hex | 5d11cc18eb19 |
102331020012313 has 4 divisors (see below), whose sum is σ = 102331041131728. Its totient is φ = 102330998892900.
The previous prime is 102331020012271. The next prime is 102331020012359. The reversal of 102331020012313 is 313210020133201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102331020012313 - 237 = 102193581058841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102331020012373) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 735970 + ... + 14324932.
It is an arithmetic number, because the mean of its divisors is an integer number (25582760282932).
Almost surely, 2102331020012313 is an apocalyptic number.
It is an amenable number.
102331020012313 is a deficient number, since it is larger than the sum of its proper divisors (21119415).
102331020012313 is an equidigital number, since it uses as much as digits as its factorization.
102331020012313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21119414.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 102331020012313 its reverse (313210020133201), we get a palindrome (415541040145514).
The spelling of 102331020012313 in words is "one hundred two trillion, three hundred thirty-one billion, twenty million, twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •