Base | Representation |
---|---|
bin | 10110001000000000010… |
… | …001011101110101000101 |
3 | 12101100110220010002211022 |
4 | 112020000101131311011 |
5 | 144402311242021123 |
6 | 3122250033320525 |
7 | 214563333163511 |
oct | 26100021356505 |
9 | 5340426102738 |
10 | 1520423001413 |
11 | 536898168658 |
12 | 206802706145 |
13 | b04b5627124 |
14 | 53835bc3141 |
15 | 2983a31e1c8 |
hex | 1620045dd45 |
1520423001413 has 8 divisors (see below), whose sum is σ = 1526462625600. Its totient is φ = 1514385336448.
The previous prime is 1520423001403. The next prime is 1520423001443. The reversal of 1520423001413 is 3141003240251.
It is a happy number.
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-1520423001413 is a prime.
It is a super-2 number, since 2×15204230014132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1520423001403) 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, 1075253 + ... + 2048661.
It is an arithmetic number, because the mean of its divisors is an integer number (190807828200).
Almost surely, 21520423001413 is an apocalyptic number.
It is an amenable number.
1520423001413 is a deficient number, since it is larger than the sum of its proper divisors (6039624187).
1520423001413 is an equidigital number, since it uses as much as digits as its factorization.
1520423001413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 979611.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 1520423001413 its reverse (3141003240251), we get a palindrome (4661426241664).
The spelling of 1520423001413 in words is "one trillion, five hundred twenty billion, four hundred twenty-three million, one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •