Base | Representation |
---|---|
bin | 101111100011110011… |
… | …1011010000111111010 |
3 | 100202121211201101102221 |
4 | 1133013213122013322 |
5 | 3133132102310120 |
6 | 114530325514254 |
7 | 10243646152651 |
oct | 1370747320772 |
9 | 322554641387 |
10 | 102133244410 |
11 | 3a35061020a |
12 | 1796427298a |
13 | 982876a242 |
14 | 4d2c4c2198 |
15 | 29cb66c0aa |
hex | 17c79da1fa |
102133244410 has 8 divisors (see below), whose sum is σ = 183839839956. Its totient is φ = 40853297760.
The previous prime is 102133244393. The next prime is 102133244417. The reversal of 102133244410 is 14442331201.
It can be written as a sum of positive squares in 2 ways, for example, as 97506932121 + 4626312289 = 312261^2 + 68017^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1021332444102 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102133244417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5106662211 + ... + 5106662230.
Almost surely, 2102133244410 is an apocalyptic number.
102133244410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102133244410 is a deficient number, since it is larger than the sum of its proper divisors (81706595546).
102133244410 is a wasteful number, since it uses less digits than its factorization.
102133244410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10213324448.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 102133244410 its reverse (14442331201), we get a palindrome (116575575611).
The spelling of 102133244410 in words is "one hundred two billion, one hundred thirty-three million, two hundred forty-four thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •