Base | Representation |
---|---|
bin | 10111010001000111011110… |
… | …110000010000110111010101 |
3 | 111102022210001112200210121101 |
4 | 113101013132300100313111 |
5 | 101403044032223134031 |
6 | 1001350210532150101 |
7 | 30361123553642560 |
oct | 2721073660206725 |
9 | 442283045623541 |
10 | 102331333021141 |
11 | 2a673524799854 |
12 | b5885b8468331 |
13 | 4513a59acb0c3 |
14 | 1b3ac11cc74d7 |
15 | bc6d15ae9361 |
hex | 5d11dec10dd5 |
102331333021141 has 8 divisors (see below), whose sum is σ = 117452026620864. Its totient is φ = 87336122356320.
The previous prime is 102331333021139. The next prime is 102331333021153. The reversal of 102331333021141 is 141120333133201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102331333021141 - 21 = 102331333021139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102331333021111) 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, 31370731975 + ... + 31370735236.
It is an arithmetic number, because the mean of its divisors is an integer number (14681503327608).
Almost surely, 2102331333021141 is an apocalyptic number.
It is an amenable number.
102331333021141 is a deficient number, since it is larger than the sum of its proper divisors (15120693599723).
102331333021141 is an equidigital number, since it uses as much as digits as its factorization.
102331333021141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62741467451.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 102331333021141 its reverse (141120333133201), we get a palindrome (243451666154342).
The spelling of 102331333021141 in words is "one hundred two trillion, three hundred thirty-one billion, three hundred thirty-three million, twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •