Base | Representation |
---|---|
bin | 10011001101001001101010… |
… | …00001011110110100111111 |
3 | 12112112110112111112100200110 |
4 | 21212210311001132310333 |
5 | 21013422301032034211 |
6 | 225453413410201103 |
7 | 11616153422253252 |
oct | 1146446501366477 |
9 | 175473474470613 |
10 | 42233303002431 |
11 | 12503052585762 |
12 | 48a111b883193 |
13 | 1a74777906ba8 |
14 | a60162013099 |
15 | 4d38b9c3eea6 |
hex | 26693505ed3f |
42233303002431 has 8 divisors (see below), whose sum is σ = 56312141860480. Its totient is φ = 28154999739672.
The previous prime is 42233303002427. The next prime is 42233303002433. The reversal of 42233303002431 is 13420030333224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42233303002431 - 22 = 42233303002427 is a prime.
It is a super-2 number, since 2×422333030024312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42233303002433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133714795 + ... + 134030268.
It is an arithmetic number, because the mean of its divisors is an integer number (7039017732560).
Almost surely, 242233303002431 is an apocalyptic number.
42233303002431 is a deficient number, since it is larger than the sum of its proper divisors (14078838858049).
42233303002431 is a wasteful number, since it uses less digits than its factorization.
42233303002431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267797645.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 42233303002431 its reverse (13420030333224), we get a palindrome (55653333335655).
The spelling of 42233303002431 in words is "forty-two trillion, two hundred thirty-three billion, three hundred three million, two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •