Base | Representation |
---|---|
bin | 10101010011110101001… |
… | …111101010100011110010 |
3 | 12011222212210100202100201 |
4 | 111103311033222203302 |
5 | 142443044232430132 |
6 | 3040423155105414 |
7 | 210541165364224 |
oct | 25236517524362 |
9 | 5158783322321 |
10 | 1464403405042 |
11 | 5150605aa776 |
12 | 1b79898a226a |
13 | a8128719b76 |
14 | 50c3dc22414 |
15 | 2815c2702e7 |
hex | 154f53ea8f2 |
1464403405042 has 4 divisors (see below), whose sum is σ = 2196605107566. Its totient is φ = 732201702520.
The previous prime is 1464403405021. The next prime is 1464403405043. The reversal of 1464403405042 is 2405043044641.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 1368148963041 + 96254442001 = 1169679^2 + 310249^2 .
It is a super-2 number, since 2×14644034050422 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1464403404992 and 1464403405010.
It is not an unprimeable number, because it can be changed into a prime (1464403405043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 366100851259 + ... + 366100851262.
Almost surely, 21464403405042 is an apocalyptic number.
1464403405042 is a deficient number, since it is larger than the sum of its proper divisors (732201702524).
1464403405042 is an equidigital number, since it uses as much as digits as its factorization.
1464403405042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732201702523.
The product of its (nonzero) digits is 184320, while the sum is 37.
Adding to 1464403405042 its reverse (2405043044641), we get a palindrome (3869446449683).
The spelling of 1464403405042 in words is "one trillion, four hundred sixty-four billion, four hundred three million, four hundred five thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •