Base | Representation |
---|---|
bin | 101111100011011100… |
… | …1000110000001000111 |
3 | 100202120222212120011001 |
4 | 1133012321012001013 |
5 | 3133121000302211 |
6 | 114525213354131 |
7 | 10243441025344 |
oct | 1370671060107 |
9 | 322528776131 |
10 | 102121103431 |
11 | 3a344778546 |
12 | 17960198947 |
13 | 98260a9029 |
14 | 4d2aa417cb |
15 | 29ca56eac1 |
hex | 17c6e46047 |
102121103431 has 8 divisors (see below), whose sum is σ = 102920978160. Its totient is φ = 101323343232.
The previous prime is 102121103419. The next prime is 102121103437. The reversal of 102121103431 is 134301121201.
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-102121103431 is a prime.
It is a super-2 number, since 2×1021211034312 (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 = 102121103399 and 102121103408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102121103437) 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, 431596 + ... + 624913.
It is an arithmetic number, because the mean of its divisors is an integer number (12865122270).
Almost surely, 2102121103431 is an apocalyptic number.
102121103431 is a deficient number, since it is larger than the sum of its proper divisors (799874729).
102121103431 is a wasteful number, since it uses less digits than its factorization.
102121103431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1057265.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 102121103431 its reverse (134301121201), we get a palindrome (236422224632).
The spelling of 102121103431 in words is "one hundred two billion, one hundred twenty-one million, one hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •