Base | Representation |
---|---|
bin | 11001101101011… |
… | …000000000010001 |
3 | 1010001121120221110 |
4 | 121231120000101 |
5 | 1340404401301 |
6 | 110444443533 |
7 | 13455126606 |
oct | 3155300021 |
9 | 1101546843 |
10 | 431325201 |
11 | 20152100a |
12 | 1005495a9 |
13 | 6b48b818 |
14 | 413da6ad |
15 | 27d000d6 |
hex | 19b58011 |
431325201 has 8 divisors (see below), whose sum is σ = 579238240. Its totient is φ = 285481152.
The previous prime is 431325199. The next prime is 431325203. The reversal of 431325201 is 102523134.
It is an interprime number because it is at equal distance from previous prime (431325199) and next prime (431325203).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 431325201 - 21 = 431325199 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (431325203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 516760 + ... + 517593.
It is an arithmetic number, because the mean of its divisors is an integer number (72404780).
Almost surely, 2431325201 is an apocalyptic number.
It is an amenable number.
431325201 is a deficient number, since it is larger than the sum of its proper divisors (147913039).
431325201 is a wasteful number, since it uses less digits than its factorization.
431325201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034495.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 431325201 is about 20768.3702056757. The cubic root of 431325201 is about 755.5588167303.
Adding to 431325201 its reverse (102523134), we get a palindrome (533848335).
The spelling of 431325201 in words is "four hundred thirty-one million, three hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •