Base | Representation |
---|---|
bin | 10011000110101101100011… |
… | …11110110100001010101101 |
3 | 12111202022110202222001220112 |
4 | 21203112301332310022231 |
5 | 21001311200123443023 |
6 | 225204024025425405 |
7 | 11564162016505664 |
oct | 1143266176641255 |
9 | 174668422861815 |
10 | 42012061156013 |
11 | 124282402a7993 |
12 | 486627633b265 |
13 | 1a59949856830 |
14 | a53574b45ddb |
15 | 4ccc6b9ea478 |
hex | 2635b1fb42ad |
42012061156013 has 16 divisors (see below), whose sum is σ = 45985859060400. Its totient is φ = 38144288724480.
The previous prime is 42012061155991. The next prime is 42012061156033. The reversal of 42012061156013 is 31065116021024.
It can be written as a sum of positive squares in 8 ways, for example, as 335198155369 + 41676863000644 = 578963^2 + 6455762^2 .
It is a cyclic number.
It is not a de Polignac number, because 42012061156013 - 216 = 42012061090477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42012061156033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 174806993 + ... + 175047161.
It is an arithmetic number, because the mean of its divisors is an integer number (2874116191275).
Almost surely, 242012061156013 is an apocalyptic number.
It is an amenable number.
42012061156013 is a deficient number, since it is larger than the sum of its proper divisors (3973797904387).
42012061156013 is a wasteful number, since it uses less digits than its factorization.
42012061156013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460832.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 42012061156013 its reverse (31065116021024), we get a palindrome (73077177177037).
The spelling of 42012061156013 in words is "forty-two trillion, twelve billion, sixty-one million, one hundred fifty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •