Base | Representation |
---|---|
bin | 10011001111011010110101… |
… | …00000111100110101100101 |
3 | 12112210220201011102012102111 |
4 | 21213231122200330311211 |
5 | 21021211410300421013 |
6 | 225553303241041021 |
7 | 11624613002005660 |
oct | 1147553240746545 |
9 | 175726634365374 |
10 | 42311241420133 |
11 | 12533107803514 |
12 | 48b4251186171 |
13 | 1a7bc188b240a |
14 | a63c370626d7 |
15 | 4d592c23473d |
hex | 267b5a83cd65 |
42311241420133 has 16 divisors (see below), whose sum is σ = 50504354674560. Its totient is φ = 34688517264576.
The previous prime is 42311241420121. The next prime is 42311241420139. The reversal of 42311241420133 is 33102414211324.
It is a happy number.
It is not a de Polignac number, because 42311241420133 - 29 = 42311241419621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42311241420095 and 42311241420104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42311241420139) 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, 1384424266 + ... + 1384454827.
It is an arithmetic number, because the mean of its divisors is an integer number (3156522167160).
Almost surely, 242311241420133 is an apocalyptic number.
It is an amenable number.
42311241420133 is a deficient number, since it is larger than the sum of its proper divisors (8193113254427).
42311241420133 is a wasteful number, since it uses less digits than its factorization.
42311241420133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2768879196.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 42311241420133 its reverse (33102414211324), we get a palindrome (75413655631457).
The spelling of 42311241420133 in words is "forty-two trillion, three hundred eleven billion, two hundred forty-one million, four hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •