Base | Representation |
---|---|
bin | 101001110010011… |
… | …0100001111101111 |
3 | 10121201102010001222 |
4 | 1103210310033233 |
5 | 10332423110421 |
6 | 351045053555 |
7 | 46514110232 |
oct | 12344641757 |
9 | 3551363058 |
10 | 1402160111 |
11 | 65a534710 |
12 | 3316b72bb |
13 | 194656a51 |
14 | d4315419 |
15 | 8316ecab |
hex | 539343ef |
1402160111 has 8 divisors (see below), whose sum is σ = 1531122384. Its totient is φ = 1273446720.
The previous prime is 1402160093. The next prime is 1402160117. The reversal of 1402160111 is 1110612041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1402160111 - 214 = 1402143727 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1402160111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1402160117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50336 + ... + 73061.
It is an arithmetic number, because the mean of its divisors is an integer number (191390298).
Almost surely, 21402160111 is an apocalyptic number.
1402160111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1402160111 is a deficient number, since it is larger than the sum of its proper divisors (128962273).
1402160111 is a wasteful number, since it uses less digits than its factorization.
1402160111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124441.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 1402160111 is about 37445.4284392635. The cubic root of 1402160111 is about 1119.2640017296.
Adding to 1402160111 its reverse (1110612041), we get a palindrome (2512772152).
The spelling of 1402160111 in words is "one billion, four hundred two million, one hundred sixty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •