Base | Representation |
---|---|
bin | 10111011111001110101010… |
… | …101000101000001001011110 |
3 | 111112202111020202021100121011 |
4 | 113133032222220220021132 |
5 | 102014441144012304042 |
6 | 1003411514022525434 |
7 | 30521155040365435 |
oct | 2737165250501136 |
9 | 445674222240534 |
10 | 103301121213022 |
11 | 2aa07839963087 |
12 | b70454859687a |
13 | 458433bb719b5 |
14 | 1b71b2db0c11c |
15 | be2174d48a17 |
hex | 5df3aaa2825e |
103301121213022 has 4 divisors (see below), whose sum is σ = 154951681819536. Its totient is φ = 51650560606510.
The previous prime is 103301121213007. The next prime is 103301121213029. The reversal of 103301121213022 is 220312121103301.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1033011212130222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103301121212984 and 103301121213002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103301121213029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25825280303254 + ... + 25825280303257.
It is an arithmetic number, because the mean of its divisors is an integer number (38737920454884).
Almost surely, 2103301121213022 is an apocalyptic number.
103301121213022 is a deficient number, since it is larger than the sum of its proper divisors (51650560606514).
103301121213022 is an equidigital number, since it uses as much as digits as its factorization.
103301121213022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51650560606513.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 103301121213022 its reverse (220312121103301), we get a palindrome (323613242316323).
The spelling of 103301121213022 in words is "one hundred three trillion, three hundred one billion, one hundred twenty-one million, two hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •