Base | Representation |
---|---|
bin | 1010111100111001010110… |
… | …1010110000001100101101 |
3 | 1120122010201012111010222120 |
4 | 2233032111222300030231 |
5 | 3034241042402441331 |
6 | 41335410541303153 |
7 | 2351645514103410 |
oct | 257162552601455 |
9 | 46563635433876 |
10 | 12041304343341 |
11 | 3922763427349 |
12 | 1425828564ab9 |
13 | 69464aa6b030 |
14 | 2d8b334bbb77 |
15 | 15d34e1a4796 |
hex | af395ab032d |
12041304343341 has 64 divisors (see below), whose sum is σ = 20029233100800. Its totient is φ = 6265460180736.
The previous prime is 12041304343337. The next prime is 12041304343421. The reversal of 12041304343341 is 14334340314021.
It is not a de Polignac number, because 12041304343341 - 22 = 12041304343337 is a prime.
It is a super-2 number, since 2×120413043433412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12041304342341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5863530 + ... + 7646148.
It is an arithmetic number, because the mean of its divisors is an integer number (312956767200).
Almost surely, 212041304343341 is an apocalyptic number.
It is an amenable number.
12041304343341 is a deficient number, since it is larger than the sum of its proper divisors (7987928757459).
12041304343341 is a wasteful number, since it uses less digits than its factorization.
12041304343341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1782978.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 12041304343341 its reverse (14334340314021), we get a palindrome (26375644657362).
The spelling of 12041304343341 in words is "twelve trillion, forty-one billion, three hundred four million, three hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •