Base | Representation |
---|---|
bin | 101010000011101… |
… | …0101111100001111 |
3 | 10122100102221120221 |
4 | 1110013111330033 |
5 | 10342232223043 |
6 | 352011052211 |
7 | 46654044565 |
oct | 12407257417 |
9 | 3570387527 |
10 | 1411211023 |
11 | 664656802 |
12 | 334741067 |
13 | 1964a5611 |
14 | d55cda35 |
15 | 83d5b8ed |
hex | 541d5f0f |
1411211023 has 8 divisors (see below), whose sum is σ = 1506814848. Its totient is φ = 1318461144.
The previous prime is 1411211003. The next prime is 1411211059. The reversal of 1411211023 is 3201121141.
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-1411211023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1411210988 and 1411211006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1411211003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 712465 + ... + 714442.
It is an arithmetic number, because the mean of its divisors is an integer number (188351856).
Almost surely, 21411211023 is an apocalyptic number.
1411211023 is a deficient number, since it is larger than the sum of its proper divisors (95603825).
1411211023 is a wasteful number, since it uses less digits than its factorization.
1411211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1426973.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1411211023 is about 37566.0887370511. The cubic root of 1411211023 is about 1121.6671131039.
Adding to 1411211023 its reverse (3201121141), we get a palindrome (4612332164).
The spelling of 1411211023 in words is "one billion, four hundred eleven million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •