Base | Representation |
---|---|
bin | 1101101001111100111… |
… | …11111111101100010001 |
3 | 1122212002100121002220012 |
4 | 12310332133333230101 |
5 | 30141410200310001 |
6 | 555314132324305 |
7 | 45620133165212 |
oct | 6647637775421 |
9 | 1585070532805 |
10 | 469200010001 |
11 | 170a941a0108 |
12 | 76b26173695 |
13 | 35326107518 |
14 | 189d0853409 |
15 | c311b852bb |
hex | 6d3e7ffb11 |
469200010001 has 4 divisors (see below), whose sum is σ = 469481138100. Its totient is φ = 468918881904.
The previous prime is 469200009947. The next prime is 469200010043. The reversal of 469200010001 is 100010002964.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 195738995776 + 273461014225 = 442424^2 + 522935^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-469200010001 is a prime.
It is a Duffinian number.
469200010001 is a modest number, since divided by 10001 gives 4692 as remainder.
It is not an unprimeable number, because it can be changed into a prime (469200013001) 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, 140561546 + ... + 140564883.
It is an arithmetic number, because the mean of its divisors is an integer number (117370284525).
Almost surely, 2469200010001 is an apocalyptic number.
It is an amenable number.
469200010001 is a deficient number, since it is larger than the sum of its proper divisors (281128099).
469200010001 is a wasteful number, since it uses less digits than its factorization.
469200010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281128098.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 469200010001 its reverse (100010002964), we get a palindrome (569210012965).
The spelling of 469200010001 in words is "four hundred sixty-nine billion, two hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •