Base | Representation |
---|---|
bin | 11011111111000… |
… | …111110010011001 |
3 | 1012201111200112201 |
4 | 123333013302121 |
5 | 1430200004201 |
6 | 114331410201 |
7 | 14430645244 |
oct | 3377076231 |
9 | 1181450481 |
10 | 469531801 |
11 | 221047212 |
12 | 1112b3961 |
13 | 76377c8b |
14 | 4650425b |
15 | 2b34a801 |
hex | 1bfc7c99 |
469531801 has 4 divisors (see below), whose sum is σ = 469912612. Its totient is φ = 469150992.
The previous prime is 469531793. The next prime is 469531807. The reversal of 469531801 is 108135964.
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 241491600 + 228040201 = 15540^2 + 15101^2 .
It is a cyclic number.
It is not a de Polignac number, because 469531801 - 23 = 469531793 is a prime.
It is a super-2 number, since 2×4695318012 = 440920224300607202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (469531807) 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, 188550 + ... + 191023.
It is an arithmetic number, because the mean of its divisors is an integer number (117478153).
Almost surely, 2469531801 is an apocalyptic number.
It is an amenable number.
469531801 is a deficient number, since it is larger than the sum of its proper divisors (380811).
469531801 is a wasteful number, since it uses less digits than its factorization.
469531801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380810.
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 469531801 is about 21668.6824934051. The cubic root of 469531801 is about 777.2397510577.
The spelling of 469531801 in words is "four hundred sixty-nine million, five hundred thirty-one thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •