Base | Representation |
---|---|
bin | 10011010000000000011001… |
… | …10010000100111001000001 |
3 | 12112212211202220011002021002 |
4 | 21220000030302010321001 |
5 | 21022024213000420301 |
6 | 230010440545141345 |
7 | 11626225566110315 |
oct | 1150001462047101 |
9 | 175784686132232 |
10 | 42331412123201 |
11 | 12540718625253 |
12 | 48b814032a855 |
13 | 1a80ab1757386 |
14 | a64bcbca1b45 |
15 | 4d620ce6e16b |
hex | 26800cc84e41 |
42331412123201 has 16 divisors (see below), whose sum is σ = 43612292290896. Its totient is φ = 41070087991296.
The previous prime is 42331412123197. The next prime is 42331412123213. The reversal of 42331412123201 is 10232121413324.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 17165899080625 + 25165513042576 = 4143175^2 + 5016524^2 .
It is a cyclic number.
It is not a de Polignac number, because 42331412123201 - 22 = 42331412123197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42331412123701) 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, 5568650 + ... + 10755123.
It is an arithmetic number, because the mean of its divisors is an integer number (2725768268181).
Almost surely, 242331412123201 is an apocalyptic number.
It is an amenable number.
42331412123201 is a deficient number, since it is larger than the sum of its proper divisors (1280880167695).
42331412123201 is a wasteful number, since it uses less digits than its factorization.
42331412123201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16324372.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 42331412123201 its reverse (10232121413324), we get a palindrome (52563533536525).
The spelling of 42331412123201 in words is "forty-two trillion, three hundred thirty-one billion, four hundred twelve million, one hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •