Base | Representation |
---|---|
bin | 10111010001001000011000… |
… | …100000110010100100011110 |
3 | 111102022212120002002020021111 |
4 | 113101020120200302210132 |
5 | 101403103023310342142 |
6 | 1001350451025452234 |
7 | 30361156561333453 |
oct | 2721103040624436 |
9 | 442285502066244 |
10 | 102332302043422 |
11 | 2a673981784610 |
12 | b588828aa107a |
13 | 4513b827b0279 |
14 | 1b3aca488d82a |
15 | bc6d70c0be17 |
hex | 5d121883291e |
102332302043422 has 32 divisors (see below), whose sum is σ = 172597819451904. Its totient is φ = 45101318539200.
The previous prime is 102332302043399. The next prime is 102332302043429. The reversal of 102332302043422 is 224340203233201.
102332302043422 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102332302043429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 394664854 + ... + 394924057.
It is an arithmetic number, because the mean of its divisors is an integer number (5393681857872).
Almost surely, 2102332302043422 is an apocalyptic number.
102332302043422 is a deficient number, since it is larger than the sum of its proper divisors (70265517408482).
102332302043422 is a wasteful number, since it uses less digits than its factorization.
102332302043422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789589104.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 102332302043422 its reverse (224340203233201), we get a palindrome (326672505276623).
The spelling of 102332302043422 in words is "one hundred two trillion, three hundred thirty-two billion, three hundred two million, forty-three thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •