Base | Representation |
---|---|
bin | 101001110010100… |
… | …0001111111101111 |
3 | 10121201111222022220 |
4 | 1103211001333233 |
5 | 10332431411211 |
6 | 351050210423 |
7 | 46514433360 |
oct | 12345017757 |
9 | 3551458286 |
10 | 1402216431 |
11 | 65a572a60 |
12 | 331723a13 |
13 | 194676585 |
14 | d432bb67 |
15 | 83181806 |
hex | 53941fef |
1402216431 has 32 divisors (see below), whose sum is σ = 2354075136. Its totient is φ = 721200000.
The previous prime is 1402216429. The next prime is 1402216451. The reversal of 1402216431 is 1346122041.
It is not a de Polignac number, because 1402216431 - 21 = 1402216429 is a prime.
It is a super-2 number, since 2×14022164312 = 3932421838732755522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1402216421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6720 + ... + 53381.
It is an arithmetic number, because the mean of its divisors is an integer number (73564848).
Almost surely, 21402216431 is an apocalyptic number.
1402216431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1402216431 is a deficient number, since it is larger than the sum of its proper divisors (951858705).
1402216431 is a wasteful number, since it uses less digits than its factorization.
1402216431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60223.
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 1402216431 is about 37446.1804594274. The cubic root of 1402216431 is about 1119.2789872043.
Adding to 1402216431 its reverse (1346122041), we get a palindrome (2748338472).
The spelling of 1402216431 in words is "one billion, four hundred two million, two hundred sixteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •