Base | Representation |
---|---|
bin | 1010111101001001001001… |
… | …1100101110110100010001 |
3 | 1120122112122202121020101010 |
4 | 2233102102130232310101 |
5 | 3034323234044201223 |
6 | 41341351440001133 |
7 | 2352155561501244 |
oct | 257222234566421 |
9 | 46575582536333 |
10 | 12045545303313 |
11 | 392453a32a345 |
12 | 14266109001a9 |
13 | 694b755884c2 |
14 | 2d901683725b |
15 | 15d4eb675393 |
hex | af49272ed11 |
12045545303313 has 8 divisors (see below), whose sum is σ = 16060823553888. Its totient is φ = 8030315294144.
The previous prime is 12045545303303. The next prime is 12045545303329. The reversal of 12045545303313 is 31330354554021.
12045545303313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12045545303313 - 26 = 12045545303249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12045545303303) 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, 11473656 + ... + 12479417.
It is an arithmetic number, because the mean of its divisors is an integer number (2007602944236).
Almost surely, 212045545303313 is an apocalyptic number.
It is an amenable number.
12045545303313 is a deficient number, since it is larger than the sum of its proper divisors (4015278250575).
12045545303313 is a wasteful number, since it uses less digits than its factorization.
12045545303313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24120703.
The product of its (nonzero) digits is 324000, while the sum is 39.
Adding to 12045545303313 its reverse (31330354554021), we get a palindrome (43375899857334).
The spelling of 12045545303313 in words is "twelve trillion, forty-five billion, five hundred forty-five million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •