Base | Representation |
---|---|
bin | 101001110010100… |
… | …1000000001100011 |
3 | 10121201120020012102 |
4 | 1103211020001203 |
5 | 10332433203443 |
6 | 351050521015 |
7 | 46514565353 |
oct | 12345100143 |
9 | 3551506172 |
10 | 1402241123 |
11 | 65a58a568 |
12 | 33173616b |
13 | 19468489a |
14 | d4336b63 |
15 | 83188cb8 |
hex | 53948063 |
1402241123 has 8 divisors (see below), whose sum is σ = 1436940960. Its totient is φ = 1367565120.
The previous prime is 1402241111. The next prime is 1402241131. The reversal of 1402241123 is 3211422041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1402241123 is a prime.
It is a super-2 number, since 2×14022411232 = 3932560334064602258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1402241095 and 1402241104.
It is not an unprimeable number, because it can be changed into a prime (1402243123) 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, 197786 + ... + 204752.
It is an arithmetic number, because the mean of its divisors is an integer number (179617620).
Almost surely, 21402241123 is an apocalyptic number.
1402241123 is a deficient number, since it is larger than the sum of its proper divisors (34699837).
1402241123 is an equidigital number, since it uses as much as digits as its factorization.
1402241123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11917.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 1402241123 is about 37446.5101578238. The cubic root of 1402241123 is about 1119.2855570589.
Adding to 1402241123 its reverse (3211422041), we get a palindrome (4613663164).
The spelling of 1402241123 in words is "one billion, four hundred two million, two hundred forty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •