Base | Representation |
---|---|
bin | 1011001110100101110101… |
… | …0010011110011011110001 |
3 | 1121201012101021002010110211 |
4 | 2303221131102132123301 |
5 | 3104231134042224131 |
6 | 42131204131424121 |
7 | 2412630033142132 |
oct | 263513522363361 |
9 | 47635337063424 |
10 | 12345301133041 |
11 | 3a2a681714928 |
12 | 1474728455041 |
13 | 6b7206936056 |
14 | 309731379c89 |
15 | 1661e26a25b1 |
hex | b3a5d49e6f1 |
12345301133041 has 8 divisors (see below), whose sum is σ = 12401065961984. Its totient is φ = 12289539918240.
The previous prime is 12345301133029. The next prime is 12345301133101. The reversal of 12345301133041 is 14033110354321.
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 12345301133041 - 227 = 12345166915313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12345301132994 and 12345301133012.
It is not an unprimeable number, because it can be changed into a prime (12345301193041) 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, 6064636 + ... + 7840306.
It is an arithmetic number, because the mean of its divisors is an integer number (1550133245248).
Almost surely, 212345301133041 is an apocalyptic number.
It is an amenable number.
12345301133041 is a deficient number, since it is larger than the sum of its proper divisors (55764828943).
12345301133041 is a wasteful number, since it uses less digits than its factorization.
12345301133041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1807071.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 12345301133041 its reverse (14033110354321), we get a palindrome (26378411487362).
The spelling of 12345301133041 in words is "twelve trillion, three hundred forty-five billion, three hundred one million, one hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •