Base | Representation |
---|---|
bin | 10100101101010100100… |
… | …101101100011001100001 |
3 | 12001001011000220220221122 |
4 | 110231110211230121201 |
5 | 141303403123423210 |
6 | 3005424111502025 |
7 | 204545405554400 |
oct | 24552445543141 |
9 | 5031130826848 |
10 | 1423053342305 |
11 | 4a9571570601 |
12 | 1ab969827915 |
13 | a4268a5181a |
14 | 4cc3a221637 |
15 | 2703bea9b55 |
hex | 14b5496c661 |
1423053342305 has 48 divisors (see below), whose sum is σ = 2035897914960. Its totient is φ = 951548774400.
The previous prime is 1423053342287. The next prime is 1423053342311. The reversal of 1423053342305 is 5032433503241.
It can be written as a sum of positive squares in 8 ways, for example, as 8019381601 + 1415033960704 = 89551^2 + 1189552^2 .
It is not a de Polignac number, because 1423053342305 - 226 = 1422986233441 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 21473261 + ... + 21539429.
It is an arithmetic number, because the mean of its divisors is an integer number (42414539895).
Almost surely, 21423053342305 is an apocalyptic number.
It is an amenable number.
1423053342305 is a deficient number, since it is larger than the sum of its proper divisors (612844572655).
1423053342305 is a wasteful number, since it uses less digits than its factorization.
1423053342305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68370 (or 68363 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 35.
Adding to 1423053342305 its reverse (5032433503241), we get a palindrome (6455486845546).
The spelling of 1423053342305 in words is "one trillion, four hundred twenty-three billion, fifty-three million, three hundred forty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •