Base | Representation |
---|---|
bin | 1100000010000111001100… |
… | …1101101100111010000100 |
3 | 1201211211001120102100112022 |
4 | 3000201303031230322010 |
5 | 3213231411123241312 |
6 | 44045550543142312 |
7 | 2533603305350033 |
oct | 300416315547204 |
9 | 51754046370468 |
10 | 13230432243332 |
11 | 4240aa40a2817 |
12 | 1598190ba4998 |
13 | 74c816a90065 |
14 | 33a4dbb0a71a |
15 | 17e249667172 |
hex | c087336ce84 |
13230432243332 has 48 divisors (see below), whose sum is σ = 24982651774080. Its totient is φ = 6107417052672.
The previous prime is 13230432243331. The next prime is 13230432243389. The reversal of 13230432243332 is 23334223403231.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13230432243292 and 13230432243301.
It is not an unprimeable number, because it can be changed into a prime (13230432243331) 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 15 ways as a sum of consecutive naturals, for example, 18193169 + ... + 18906407.
It is an arithmetic number, because the mean of its divisors is an integer number (520471911960).
Almost surely, 213230432243332 is an apocalyptic number.
It is an amenable number.
13230432243332 is a deficient number, since it is larger than the sum of its proper divisors (11752219530748).
13230432243332 is a wasteful number, since it uses less digits than its factorization.
13230432243332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 718460 (or 718458 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 35.
Adding to 13230432243332 its reverse (23334223403231), we get a palindrome (36564655646563).
The spelling of 13230432243332 in words is "thirteen trillion, two hundred thirty billion, four hundred thirty-two million, two hundred forty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •