Base | Representation |
---|---|
bin | 101010101010001… |
… | …0111001100000111 |
3 | 10200202102201100010 |
4 | 1111110113030013 |
5 | 10412414314343 |
6 | 354011521303 |
7 | 50320465260 |
oct | 12524271407 |
9 | 3622381303 |
10 | 1431401223 |
11 | 674a96a1a |
12 | 33b459233 |
13 | 19a724495 |
14 | d8167967 |
15 | 859e8d33 |
hex | 55517307 |
1431401223 has 32 divisors (see below), whose sum is σ = 2254602240. Its totient is φ = 790483680.
The previous prime is 1431401221. The next prime is 1431401269. The reversal of 1431401223 is 3221041341.
It is not a de Polignac number, because 1431401223 - 21 = 1431401221 is a prime.
It is a super-2 number, since 2×14314012232 = 4097818922411791458, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1431401223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1431401221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 857836 + ... + 859502.
It is an arithmetic number, because the mean of its divisors is an integer number (70456320).
Almost surely, 21431401223 is an apocalyptic number.
1431401223 is a deficient number, since it is larger than the sum of its proper divisors (823201017).
1431401223 is a wasteful number, since it uses less digits than its factorization.
1431401223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3027.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1431401223 is about 37833.8634426885. The cubic root of 1431401223 is about 1126.9910349600.
Adding to 1431401223 its reverse (3221041341), we get a palindrome (4652442564).
The spelling of 1431401223 in words is "one billion, four hundred thirty-one million, four hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •