Base | Representation |
---|---|
bin | 101111100111000001… |
… | …1110001001001010000 |
3 | 100202220101010022111120 |
4 | 1133032003301021100 |
5 | 3133342240421112 |
6 | 114545150442240 |
7 | 10246431032244 |
oct | 1371603611120 |
9 | 322811108446 |
10 | 102241342032 |
11 | 3a3a6632595 |
12 | 17994503380 |
13 | 9844c8772b |
14 | 4d3c9c0424 |
15 | 29d5dc0e8c |
hex | 17ce0f1250 |
102241342032 has 40 divisors (see below), whose sum is σ = 264316850496. Its totient is φ = 34055494656.
The previous prime is 102241342001. The next prime is 102241342097. The reversal of 102241342032 is 230243142201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 102241341993 and 102241342011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 713473 + ... + 844704.
Almost surely, 2102241342032 is an apocalyptic number.
102241342032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102241342032 is an abundant number, since it is smaller than the sum of its proper divisors (162075508464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102241342032 is a wasteful number, since it uses less digits than its factorization.
102241342032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1559555 (or 1559549 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 102241342032 its reverse (230243142201), we get a palindrome (332484484233).
The spelling of 102241342032 in words is "one hundred two billion, two hundred forty-one million, three hundred forty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •