Base | Representation |
---|---|
bin | 111000110100110001… |
… | …1111100001010100001 |
3 | 102122222111012001121011 |
4 | 1301221203330022201 |
5 | 3444404202112231 |
6 | 132020532500521 |
7 | 11550006564325 |
oct | 1615143741241 |
9 | 378874161534 |
10 | 122030113441 |
11 | 478308aa425 |
12 | 1b79777a741 |
13 | b679976222 |
14 | 5c98bdd985 |
15 | 32933159b1 |
hex | 1c698fc2a1 |
122030113441 has 4 divisors (see below), whose sum is σ = 122031712900. Its totient is φ = 122028513984.
The previous prime is 122030113427. The next prime is 122030113477. The reversal of 122030113441 is 144311030221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 144311030221 = 253247 ⋅569843.
It can be written as a sum of positive squares in 2 ways, for example, as 48197811600 + 73832301841 = 219540^2 + 271721^2 .
It is a cyclic number.
It is not a de Polignac number, because 122030113441 - 27 = 122030113313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122030113841) 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, 679236 + ... + 839893.
It is an arithmetic number, because the mean of its divisors is an integer number (30507928225).
Almost surely, 2122030113441 is an apocalyptic number.
It is an amenable number.
122030113441 is a deficient number, since it is larger than the sum of its proper divisors (1599459).
122030113441 is an equidigital number, since it uses as much as digits as its factorization.
122030113441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1599458.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 122030113441 its reverse (144311030221), we get a palindrome (266341143662).
The spelling of 122030113441 in words is "one hundred twenty-two billion, thirty million, one hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •