Base | Representation |
---|---|
bin | 1100000000011010011011… |
… | …0000110110011101010001 |
3 | 1201202000200120121210002120 |
4 | 3000012212300312131101 |
5 | 3212242110433340213 |
6 | 44024321251404453 |
7 | 2531520562213116 |
oct | 300064660663521 |
9 | 51660616553076 |
10 | 13201232324433 |
11 | 422a67a54553a |
12 | 15925a1bb3729 |
13 | 749b423a8a3a |
14 | 338d2ba4c90d |
15 | 17d5dadce423 |
hex | c01a6c36751 |
13201232324433 has 32 divisors (see below), whose sum is σ = 17708106240000. Its totient is φ = 8747789078592.
The previous prime is 13201232324389. The next prime is 13201232324459. The reversal of 13201232324433 is 33442323210231.
It is not a de Polignac number, because 13201232324433 - 212 = 13201232320337 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13201232324394 and 13201232324403.
It is not an unprimeable number, because it can be changed into a prime (13201232320433) 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 31 ways as a sum of consecutive naturals, for example, 505413348 + ... + 505439466.
It is an arithmetic number, because the mean of its divisors is an integer number (553378320000).
Almost surely, 213201232324433 is an apocalyptic number.
It is an amenable number.
13201232324433 is a deficient number, since it is larger than the sum of its proper divisors (4506873915567).
13201232324433 is a wasteful number, since it uses less digits than its factorization.
13201232324433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27989.
The product of its (nonzero) digits is 62208, while the sum is 33.
Adding to 13201232324433 its reverse (33442323210231), we get a palindrome (46643555534664).
The spelling of 13201232324433 in words is "thirteen trillion, two hundred one billion, two hundred thirty-two million, three hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •