Base | Representation |
---|---|
bin | 10111010000110111100001… |
… | …101011000000001001010001 |
3 | 111102021010211122212001200121 |
4 | 113100313201223000021101 |
5 | 101402303441214320101 |
6 | 1001334255013150241 |
7 | 30356646210362110 |
oct | 2720674153001121 |
9 | 442233748761617 |
10 | 102314202104401 |
11 | 2a667233842521 |
12 | b58521732b381 |
13 | 451225995ab91 |
14 | 1b3a068a89c77 |
15 | bc6661bb20a1 |
hex | 5d0de1ac0251 |
102314202104401 has 4 divisors (see below), whose sum is σ = 116930516690752. Its totient is φ = 87697887518052.
The previous prime is 102314202104353. The next prime is 102314202104417. The reversal of 102314202104401 is 104401202413201.
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 not a de Polignac number, because 102314202104401 - 29 = 102314202103889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102314202104441) 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, 7308157293165 + ... + 7308157293178.
It is an arithmetic number, because the mean of its divisors is an integer number (29232629172688).
Almost surely, 2102314202104401 is an apocalyptic number.
It is an amenable number.
102314202104401 is a deficient number, since it is larger than the sum of its proper divisors (14616314586351).
102314202104401 is an equidigital number, since it uses as much as digits as its factorization.
102314202104401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14616314586350.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 102314202104401 its reverse (104401202413201), we get a palindrome (206715404517602).
The spelling of 102314202104401 in words is "one hundred two trillion, three hundred fourteen billion, two hundred two million, one hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •