Base | Representation |
---|---|
bin | 1100001101010110000100… |
… | …0101000101101110100100 |
3 | 1202112021010221011111102022 |
4 | 3003111201011011232210 |
5 | 3224412111242233012 |
6 | 44314343040402312 |
7 | 2553544255232315 |
oct | 303254105055644 |
9 | 52467127144368 |
10 | 13423401524132 |
11 | 4305918238586 |
12 | 1609666016398 |
13 | 764a8a60bb52 |
14 | 3459a615660c |
15 | 184290755472 |
hex | c3561145ba4 |
13423401524132 has 6 divisors (see below), whose sum is σ = 23490952667238. Its totient is φ = 6711700762064.
The previous prime is 13423401524123. The next prime is 13423401524149. The reversal of 13423401524132 is 23142510432431.
It can be written as a sum of positive squares in only one way, i.e., 13219870615396 + 203530908736 = 3635914^2 + 451144^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13423401524092 and 13423401524101.
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 as a sum of consecutive naturals, namely, 1677925190513 + ... + 1677925190520.
It is an arithmetic number, because the mean of its divisors is an integer number (3915158777873).
Almost surely, 213423401524132 is an apocalyptic number.
It is an amenable number.
13423401524132 is a deficient number, since it is larger than the sum of its proper divisors (10067551143106).
13423401524132 is a wasteful number, since it uses less digits than its factorization.
13423401524132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3355850381037 (or 3355850381035 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 13423401524132 its reverse (23142510432431), we get a palindrome (36565911956563).
The spelling of 13423401524132 in words is "thirteen trillion, four hundred twenty-three billion, four hundred one million, five hundred twenty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •