Base | Representation |
---|---|
bin | 10111010001001000011010… |
… | …111101100100101110011011 |
3 | 111102022212122221102022202001 |
4 | 113101020122331210232123 |
5 | 101403103114321041243 |
6 | 1001350455054421431 |
7 | 30361160600562316 |
oct | 2721103275445633 |
9 | 442285587368661 |
10 | 102332343143323 |
11 | 2a6739a29a6577 |
12 | b58883a801877 |
13 | 4513b8b170637 |
14 | 1b3acaa10b97d |
15 | bc6d74629a4d |
hex | 5d121af64b9b |
102332343143323 has 8 divisors (see below), whose sum is σ = 107790695953920. Its totient is φ = 96881234334120.
The previous prime is 102332343143321. The next prime is 102332343143341. The reversal of 102332343143323 is 323341343233201.
It is a happy number.
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 102332343143323 - 21 = 102332343143321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102332343143321) 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, 1810971343 + ... + 1811027848.
It is an arithmetic number, because the mean of its divisors is an integer number (13473836994240).
Almost surely, 2102332343143323 is an apocalyptic number.
102332343143323 is a deficient number, since it is larger than the sum of its proper divisors (5458352810597).
102332343143323 is a wasteful number, since it uses less digits than its factorization.
102332343143323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3622000697.
The product of its (nonzero) digits is 279936, while the sum is 37.
Adding to 102332343143323 its reverse (323341343233201), we get a palindrome (425673686376524).
The spelling of 102332343143323 in words is "one hundred two trillion, three hundred thirty-two billion, three hundred forty-three million, one hundred forty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •