Base | Representation |
---|---|
bin | 101111100110110010… |
… | …0011100111111100111 |
3 | 100202212210200020212111 |
4 | 1133031210130333213 |
5 | 3133333140224111 |
6 | 114544254501451 |
7 | 10246301202301 |
oct | 1371544347747 |
9 | 322783606774 |
10 | 102233133031 |
11 | 3a3a1a35a97 |
12 | 17991804887 |
13 | 9843372133 |
14 | 4d3b884971 |
15 | 29d52eda21 |
hex | 17cd91cfe7 |
102233133031 has 8 divisors (see below), whose sum is σ = 105932242944. Its totient is φ = 98559102360.
The previous prime is 102233133017. The next prime is 102233133097. The reversal of 102233133031 is 130331332201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102233133031 is a prime.
It is a super-2 number, since 2×1022331330312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102233132993 and 102233133011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102233133001) 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, 6261511 + ... + 6277816.
It is an arithmetic number, because the mean of its divisors is an integer number (13241530368).
Almost surely, 2102233133031 is an apocalyptic number.
102233133031 is a deficient number, since it is larger than the sum of its proper divisors (3699109913).
102233133031 is a wasteful number, since it uses less digits than its factorization.
102233133031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12539621.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 102233133031 its reverse (130331332201), we get a palindrome (232564465232).
The spelling of 102233133031 in words is "one hundred two billion, two hundred thirty-three million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •