Base | Representation |
---|---|
bin | 11011111111100… |
… | …010111111011111 |
3 | 1012201201100101202 |
4 | 123333202333133 |
5 | 1430212040411 |
6 | 114334030115 |
7 | 14431621151 |
oct | 3377427737 |
9 | 1181640352 |
10 | 469643231 |
11 | 221112a02 |
12 | 11134833b |
13 | 763b6905 |
14 | 46532ad1 |
15 | 2b36d83b |
hex | 1bfe2fdf |
469643231 has 4 divisors (see below), whose sum is σ = 469687200. Its totient is φ = 469599264.
The previous prime is 469643227. The next prime is 469643243. The reversal of 469643231 is 132346964.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 469643231 - 22 = 469643227 is a prime.
It is a super-2 number, since 2×4696432312 = 441129528848238722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (469643221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5450 + ... + 31128.
It is an arithmetic number, because the mean of its divisors is an integer number (117421800).
Almost surely, 2469643231 is an apocalyptic number.
469643231 is a deficient number, since it is larger than the sum of its proper divisors (43969).
469643231 is a wasteful number, since it uses less digits than its factorization.
469643231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43968.
The product of its digits is 93312, while the sum is 38.
The square root of 469643231 is about 21671.2535631883. The cubic root of 469643231 is about 777.3012314338.
The spelling of 469643231 in words is "four hundred sixty-nine million, six hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •