Base | Representation |
---|---|
bin | 11011111111101… |
… | …111001000100001 |
3 | 1012201210212121121 |
4 | 123333233020201 |
5 | 1430220133321 |
6 | 114335052241 |
7 | 14432216143 |
oct | 3377571041 |
9 | 1181725547 |
10 | 469692961 |
11 | 221147301 |
12 | 111371081 |
13 | 7640343a |
14 | 46546c93 |
15 | 2b37d441 |
hex | 1bfef221 |
469692961 has 8 divisors (see below), whose sum is σ = 491351400. Its totient is φ = 448398720.
The previous prime is 469692931. The next prime is 469692967. The reversal of 469692961 is 169296964.
It can be written as a sum of positive squares in 4 ways, for example, as 44302336 + 425390625 = 6656^2 + 20625^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 469692961 - 29 = 469692449 is a prime.
It is a super-2 number, since 2×4696929612 = 441222955225895042, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 469692899 and 469692908.
It is not an unprimeable number, because it can be changed into a prime (469692967) 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, 88410 + ... + 93571.
It is an arithmetic number, because the mean of its divisors is an integer number (61418925).
Almost surely, 2469692961 is an apocalyptic number.
It is an amenable number.
469692961 is a deficient number, since it is larger than the sum of its proper divisors (21658439).
469692961 is a wasteful number, since it uses less digits than its factorization.
469692961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182099.
The product of its digits is 1259712, while the sum is 52.
The square root of 469692961 is about 21672.4009052989. The cubic root of 469692961 is about 777.3286663201.
The spelling of 469692961 in words is "four hundred sixty-nine million, six hundred ninety-two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •