Base | Representation |
---|---|
bin | 10111101011001011001100… |
… | …000100110110011101010011 |
3 | 111122122222010200001221210220 |
4 | 113223023030010312131103 |
5 | 102121413344334411311 |
6 | 1005240555054324123 |
7 | 30634365513512046 |
oct | 2753131404663523 |
9 | 448588120057726 |
10 | 104122021013331 |
11 | 301a39a0452112 |
12 | b8176661b9643 |
13 | 4613883a4c7c9 |
14 | 1b9d765a62c5d |
15 | c086bcd94206 |
hex | 5eb2cc136753 |
104122021013331 has 4 divisors (see below), whose sum is σ = 138829361351112. Its totient is φ = 69414680675552.
The previous prime is 104122021013281. The next prime is 104122021013341. The reversal of 104122021013331 is 133310120221401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104122021013331 - 210 = 104122021012307 is a prime.
It is a super-2 number, since 2×1041220210133312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104122021013341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17353670168886 + ... + 17353670168891.
It is an arithmetic number, because the mean of its divisors is an integer number (34707340337778).
Almost surely, 2104122021013331 is an apocalyptic number.
104122021013331 is a deficient number, since it is larger than the sum of its proper divisors (34707340337781).
104122021013331 is an equidigital number, since it uses as much as digits as its factorization.
104122021013331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34707340337780.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 104122021013331 its reverse (133310120221401), we get a palindrome (237432141234732).
The spelling of 104122021013331 in words is "one hundred four trillion, one hundred twenty-two billion, twenty-one million, thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •