Base | Representation |
---|---|
bin | 10100101101100100000… |
… | …010011111111010111101 |
3 | 12001001211002200010021101 |
4 | 110231210002133322331 |
5 | 141304421003122423 |
6 | 3005505531333101 |
7 | 204555004033561 |
oct | 24554402377275 |
9 | 5031732603241 |
10 | 1423312551613 |
11 | 4a9694914377 |
12 | 1aba205b1191 |
13 | a42aa669c04 |
14 | 4cc628176a1 |
15 | 27054b0c7ad |
hex | 14b6409febd |
1423312551613 has 8 divisors (see below), whose sum is σ = 1530100840320. Its totient is φ = 1319711973120.
The previous prime is 1423312551587. The next prime is 1423312551641. The reversal of 1423312551613 is 3161552133241.
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 1423312551613 - 213 = 1423312543421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1423312551653) 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 in 7 ways as a sum of consecutive naturals, for example, 796926628 + ... + 796928413.
It is an arithmetic number, because the mean of its divisors is an integer number (191262605040).
Almost surely, 21423312551613 is an apocalyptic number.
It is an amenable number.
1423312551613 is a deficient number, since it is larger than the sum of its proper divisors (106788288707).
1423312551613 is a wasteful number, since it uses less digits than its factorization.
1423312551613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1593855107.
The product of its digits is 64800, while the sum is 37.
Adding to 1423312551613 its reverse (3161552133241), we get a palindrome (4584864684854).
The spelling of 1423312551613 in words is "one trillion, four hundred twenty-three billion, three hundred twelve million, five hundred fifty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •