Base | Representation |
---|---|
bin | 10111010001000111010111… |
… | …001001011111000010111101 |
3 | 111102022202201122120202000202 |
4 | 113101013113021133002331 |
5 | 101403043302041240401 |
6 | 1001350150133133245 |
7 | 30361120444212365 |
oct | 2721072711370275 |
9 | 442282648522022 |
10 | 102331205415101 |
11 | 2a673469762513 |
12 | b58858178a225 |
13 | 4513a39540180 |
14 | 1b3abdcd8b9a5 |
15 | bc6d097e006b |
hex | 5d11d725f0bd |
102331205415101 has 8 divisors (see below), whose sum is σ = 112547577805824. Its totient is φ = 92449796053680.
The previous prime is 102331205415079. The next prime is 102331205415163. The reversal of 102331205415101 is 101514502133201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102331205415101 - 222 = 102331201220797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102331205415301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83740756685 + ... + 83740757906.
It is an arithmetic number, because the mean of its divisors is an integer number (14068447225728).
Almost surely, 2102331205415101 is an apocalyptic number.
It is an amenable number.
102331205415101 is a deficient number, since it is larger than the sum of its proper divisors (10216372390723).
102331205415101 is a wasteful number, since it uses less digits than its factorization.
102331205415101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167481514651.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 102331205415101 its reverse (101514502133201), we get a palindrome (203845707548302).
The spelling of 102331205415101 in words is "one hundred two trillion, three hundred thirty-one billion, two hundred five million, four hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •