Base | Representation |
---|---|
bin | 1100010010111110110010… |
… | …1101000001010100001000 |
3 | 1202212112002022020122112201 |
4 | 3010233230231001110020 |
5 | 3233003414211232402 |
6 | 44431035345445544 |
7 | 2563542661625344 |
oct | 304575455012410 |
9 | 52775068218481 |
10 | 13520233305352 |
11 | 4342998257a54 |
12 | 162438a9408b4 |
13 | 770c4c929707 |
14 | 34a550502624 |
15 | 186a5b76d687 |
hex | c4becb41508 |
13520233305352 has 32 divisors (see below), whose sum is σ = 25636146975000. Its totient is φ = 6683932620288.
The previous prime is 13520233305349. The next prime is 13520233305353. The reversal of 13520233305352 is 25350333202531.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 9759713394916 + 3760519910436 = 3124054^2 + 1939206^2 .
It is a super-2 number, since 2×135202333053522 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13520233305353) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 21642274 + ... + 22258222.
Almost surely, 213520233305352 is an apocalyptic number.
It is an amenable number.
13520233305352 is a deficient number, since it is larger than the sum of its proper divisors (12115913669648).
13520233305352 is a wasteful number, since it uses less digits than its factorization.
13520233305352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646873 (or 646869 counting only the distinct ones).
The product of its (nonzero) digits is 243000, while the sum is 37.
Adding to 13520233305352 its reverse (25350333202531), we get a palindrome (38870566507883).
The spelling of 13520233305352 in words is "thirteen trillion, five hundred twenty billion, two hundred thirty-three million, three hundred five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •