Base | Representation |
---|---|
bin | 11101010001110101001… |
… | …010110001110101000101 |
3 | 21010100100110122010222100 |
4 | 131101311022301311011 |
5 | 230431044134014331 |
6 | 4140145502422313 |
7 | 265235331452646 |
oct | 35216512616505 |
9 | 7110313563870 |
10 | 2012010454341 |
11 | 70631a4a2a08 |
12 | 285b36291999 |
13 | 1179689194a4 |
14 | 6d54ba2d6cd |
15 | 3750c615ae6 |
hex | 1d4752b1d45 |
2012010454341 has 6 divisors (see below), whose sum is σ = 2906237322950. Its totient is φ = 1341340302888.
The previous prime is 2012010454319. The next prime is 2012010454351. The reversal of 2012010454341 is 1434540102102.
2012010454341 is a `hidden beast` number, since 2 + 0 + 1 + 201 + 0 + 454 + 3 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1457947577025 + 554062877316 = 1207455^2 + 744354^2 .
It is not a de Polignac number, because 2012010454341 - 27 = 2012010454213 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 (2012010454351) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 111778358566 + ... + 111778358583.
Almost surely, 22012010454341 is an apocalyptic number.
It is an amenable number.
2012010454341 is a deficient number, since it is larger than the sum of its proper divisors (894226868609).
2012010454341 is a wasteful number, since it uses less digits than its factorization.
2012010454341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223556717155 (or 223556717152 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 2012010454341 its reverse (1434540102102), we get a palindrome (3446550556443).
The spelling of 2012010454341 in words is "two trillion, twelve billion, ten million, four hundred fifty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •