Base | Representation |
---|---|
bin | 111000110100011110… |
… | …1110111100111000001 |
3 | 102122221210102000102210 |
4 | 1301220331313213001 |
5 | 3444344123231223 |
6 | 132015534532333 |
7 | 11546526006621 |
oct | 1615075674701 |
9 | 378853360383 |
10 | 122020133313 |
11 | 47826203191 |
12 | 1b7943670a9 |
13 | b677890720 |
14 | 5c97762881 |
15 | 32924e3893 |
hex | 1c68f779c1 |
122020133313 has 8 divisors (see below), whose sum is σ = 175208396608. Its totient is φ = 75089312784.
The previous prime is 122020133311. The next prime is 122020133341. The reversal of 122020133313 is 313331020221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122020133313 - 21 = 122020133311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122020133313.
It is not an unprimeable number, because it can be changed into a prime (122020133311) 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, 1564360645 + ... + 1564360722.
It is an arithmetic number, because the mean of its divisors is an integer number (21901049576).
Almost surely, 2122020133313 is an apocalyptic number.
122020133313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
122020133313 is a deficient number, since it is larger than the sum of its proper divisors (53188263295).
122020133313 is a wasteful number, since it uses less digits than its factorization.
122020133313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3128721383.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 122020133313 its reverse (313331020221), we get a palindrome (435351153534).
The spelling of 122020133313 in words is "one hundred twenty-two billion, twenty million, one hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •