Base | Representation |
---|---|
bin | 11011101001101110001… |
… | …000101101100011001001 |
3 | 20201122210211102110100011 |
4 | 123221232020231203021 |
5 | 222113124132303223 |
6 | 4012541152311521 |
7 | 254200206511021 |
oct | 33515610554311 |
9 | 6648724373304 |
10 | 1900223322313 |
11 | 672975588088 |
12 | 268338b425a1 |
13 | 10a2620b6614 |
14 | 67d85362a81 |
15 | 346686a780d |
hex | 1ba6e22d8c9 |
1900223322313 has 8 divisors (see below), whose sum is σ = 2015045051400. Its totient is φ = 1785739802880.
The previous prime is 1900223322299. The next prime is 1900223322317. The reversal of 1900223322313 is 3132233220091.
It can be written as a sum of positive squares in 4 ways, for example, as 1113548341504 + 786674980809 = 1055248^2 + 886947^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1900223322313 - 25 = 1900223322281 is a prime.
It is a super-2 number, since 2×19002233223132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1900223322317) 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, 84540838 + ... + 84563311.
It is an arithmetic number, because the mean of its divisors is an integer number (251880631425).
Almost surely, 21900223322313 is an apocalyptic number.
It is an amenable number.
1900223322313 is a deficient number, since it is larger than the sum of its proper divisors (114821729087).
1900223322313 is a wasteful number, since it uses less digits than its factorization.
1900223322313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169104827.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 1900223322313 in words is "one trillion, nine hundred billion, two hundred twenty-three million, three hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •