Base | Representation |
---|---|
bin | 10001110000100100000… |
… | …011111000110100101111 |
3 | 11022200000002012110212021 |
4 | 101300210003320310233 |
5 | 124443312140223043 |
6 | 2332344410451011 |
7 | 154112022250240 |
oct | 21604403706457 |
9 | 4280002173767 |
10 | 1220375711023 |
11 | 430616301397 |
12 | 178625433a67 |
13 | 8b108a7b551 |
14 | 430d0690cc7 |
15 | 21b2891d3ed |
hex | 11c240f8d2f |
1220375711023 has 4 divisors (see below), whose sum is σ = 1394715098320. Its totient is φ = 1046036323728.
The previous prime is 1220375710999. The next prime is 1220375711053. The reversal of 1220375711023 is 3201175730221.
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 1220375711023 - 25 = 1220375710991 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 1220375711023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220375711053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87169693638 + ... + 87169693651.
It is an arithmetic number, because the mean of its divisors is an integer number (348678774580).
Almost surely, 21220375711023 is an apocalyptic number.
1220375711023 is a deficient number, since it is larger than the sum of its proper divisors (174339387297).
1220375711023 is an equidigital number, since it uses as much as digits as its factorization.
1220375711023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174339387296.
The product of its (nonzero) digits is 17640, while the sum is 34.
The spelling of 1220375711023 in words is "one trillion, two hundred twenty billion, three hundred seventy-five million, seven hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •