Base | Representation |
---|---|
bin | 1001001101001000110110… |
… | …1111111011111010110111 |
3 | 1022211120220021021211222201 |
4 | 2103102031233323322313 |
5 | 2311311431200244111 |
6 | 33305400513205331 |
7 | 2063145525612115 |
oct | 223221557737267 |
9 | 38746807254881 |
10 | 10121321103031 |
11 | 325247899a426 |
12 | 11756b5b60847 |
13 | 585589c59058 |
14 | 26dc35acaab5 |
15 | 12842ada66c1 |
hex | 9348dbfbeb7 |
10121321103031 has 8 divisors (see below), whose sum is σ = 10290933079200. Its totient is φ = 9951828116640.
The previous prime is 10121321103007. The next prime is 10121321103041. The reversal of 10121321103031 is 13030112312101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10121321103031 - 211 = 10121321100983 is a prime.
It is a super-2 number, since 2×101213211030312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121321103041) 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, 29575891 + ... + 29916148.
It is an arithmetic number, because the mean of its divisors is an integer number (1286366634900).
Almost surely, 210121321103031 is an apocalyptic number.
10121321103031 is a deficient number, since it is larger than the sum of its proper divisors (169611976169).
10121321103031 is an equidigital number, since it uses as much as digits as its factorization.
10121321103031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59494889.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10121321103031 its reverse (13030112312101), we get a palindrome (23151433415132).
The spelling of 10121321103031 in words is "ten trillion, one hundred twenty-one billion, three hundred twenty-one million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •