Base | Representation |
---|---|
bin | 10011010010000… |
… | …100110100010111 |
3 | 211112201210000122 |
4 | 103102010310113 |
5 | 1130304133211 |
6 | 52033502155 |
7 | 11005515344 |
oct | 2322046427 |
9 | 745653018 |
10 | 323505431 |
11 | 156679467 |
12 | 9041195b |
13 | 5203a942 |
14 | 30d717cb |
15 | 1d6036db |
hex | 13484d17 |
323505431 has 4 divisors (see below), whose sum is σ = 324956352. Its totient is φ = 322054512.
The previous prime is 323505397. The next prime is 323505439. The reversal of 323505431 is 134505323.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323505431 is a prime.
It is a super-2 number, since 2×3235054312 = 209311527772991522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 323505431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323505439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 725126 + ... + 725571.
It is an arithmetic number, because the mean of its divisors is an integer number (81239088).
Almost surely, 2323505431 is an apocalyptic number.
323505431 is a deficient number, since it is larger than the sum of its proper divisors (1450921).
323505431 is a wasteful number, since it uses less digits than its factorization.
323505431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450920.
The product of its (nonzero) digits is 5400, while the sum is 26.
The square root of 323505431 is about 17986.2567256225. The cubic root of 323505431 is about 686.4788983197.
The spelling of 323505431 in words is "three hundred twenty-three million, five hundred five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •