Base | Representation |
---|---|
bin | 10111010001011… |
… | …000101010111101 |
3 | 1000012200002000212 |
4 | 113101120222331 |
5 | 1244422332334 |
6 | 102424202205 |
7 | 12450425666 |
oct | 2721305275 |
9 | 1005602025 |
10 | 390433469 |
11 | 190431498 |
12 | aa909365 |
13 | 62b7212a |
14 | 39bd436d |
15 | 24423ece |
hex | 17458abd |
390433469 has 2 divisors, whose sum is σ = 390433470. Its totient is φ = 390433468.
The previous prime is 390433453. The next prime is 390433501. The reversal of 390433469 is 964334093.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 260176900 + 130256569 = 16130^2 + 11413^2 .
It is an emirp because it is prime and its reverse (964334093) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 390433469 - 24 = 390433453 is a prime.
It is a super-2 number, since 2×3904334692 = 304876587430747922, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (390433429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 195216734 + 195216735.
It is an arithmetic number, because the mean of its divisors is an integer number (195216735).
Almost surely, 2390433469 is an apocalyptic number.
It is an amenable number.
390433469 is a deficient number, since it is larger than the sum of its proper divisors (1).
390433469 is an equidigital number, since it uses as much as digits as its factorization.
390433469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 209952, while the sum is 41.
The square root of 390433469 is about 19759.3893883389. The cubic root of 390433469 is about 730.8849398121.
It can be divided in two parts, 3904 and 33469, that added together give a palindrome (37373).
The spelling of 390433469 in words is "three hundred ninety million, four hundred thirty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •