Base | Representation |
---|---|
bin | 10111010010101110110110… |
… | …010101101010111110000000 |
3 | 111102201101112201000100222212 |
4 | 113102232312111222332000 |
5 | 101411403334433024412 |
6 | 1001513204244321252 |
7 | 30402133201434530 |
oct | 2722566625527600 |
9 | 442641481010885 |
10 | 102442324111232 |
11 | 2a706600327586 |
12 | b5a60130a3228 |
13 | 4521367735841 |
14 | 1b423409794c0 |
15 | bc9b5ec13222 |
hex | 5d2bb656af80 |
102442324111232 has 64 divisors (see below), whose sum is σ = 233291489817600. Its totient is φ = 43894014180864.
The previous prime is 102442324111223. The next prime is 102442324111327. The reversal of 102442324111232 is 232111423244201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8810132 + ... + 16807827.
It is an arithmetic number, because the mean of its divisors is an integer number (3645179528400).
Almost surely, 2102442324111232 is an apocalyptic number.
It is an amenable number.
102442324111232 is an abundant number, since it is smaller than the sum of its proper divisors (130849165706368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102442324111232 is an equidigital number, since it uses as much as digits as its factorization.
102442324111232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25622443 (or 25622431 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 102442324111232 its reverse (232111423244201), we get a palindrome (334553747355433).
The spelling of 102442324111232 in words is "one hundred two trillion, four hundred forty-two billion, three hundred twenty-four million, one hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •