Base | Representation |
---|---|
bin | 101011110010010… |
… | …0011011101000001 |
3 | 10210101120002202222 |
4 | 1113210203131001 |
5 | 11002103401233 |
6 | 401442020425 |
7 | 51256665326 |
oct | 12744433501 |
9 | 3711502688 |
10 | 1469200193 |
11 | 69436393a |
12 | 350047715 |
13 | 1a54ca236 |
14 | dd1a6b4d |
15 | 88eb3898 |
hex | 57923741 |
1469200193 has 8 divisors (see below), whose sum is σ = 1487463912. Its totient is φ = 1451046016.
The previous prime is 1469200169. The next prime is 1469200199. The reversal of 1469200193 is 3910029641.
It can be written as a sum of positive squares in 4 ways, for example, as 386987584 + 1082212609 = 19672^2 + 32897^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 1469200193 - 28 = 1469199937 is a prime.
It is a super-2 number, since 2×14692001932 = 4317098414222474498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1469200199) 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, 230 + ... + 54207.
It is an arithmetic number, because the mean of its divisors is an integer number (185932989).
Almost surely, 21469200193 is an apocalyptic number.
It is an amenable number.
1469200193 is a deficient number, since it is larger than the sum of its proper divisors (18263719).
1469200193 is a wasteful number, since it uses less digits than its factorization.
1469200193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54771.
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 1469200193 is about 38330.1473125267. The cubic root of 1469200193 is about 1136.8251132978.
The spelling of 1469200193 in words is "one billion, four hundred sixty-nine million, two hundred thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.669 sec. • engine limits •