Base | Representation |
---|---|
bin | 100101100100100001… |
… | …111001001011101001 |
3 | 10212010110021222212022 |
4 | 211210201321023221 |
5 | 1130104333442413 |
6 | 30311010154225 |
7 | 2625460332125 |
oct | 454441711351 |
9 | 125113258768 |
10 | 40341312233 |
11 | 16121689a72 |
12 | 799a282975 |
13 | 3a5b9b6271 |
14 | 1d49a56585 |
15 | 10b1956608 |
hex | 9648792e9 |
40341312233 has 4 divisors (see below), whose sum is σ = 40740731268. Its totient is φ = 39941893200.
The previous prime is 40341312229. The next prime is 40341312241. The reversal of 40341312233 is 33221314304.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29423570089 + 10917742144 = 171533^2 + 104488^2 .
It is a cyclic number.
It is not a de Polignac number, because 40341312233 - 22 = 40341312229 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40341312293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 199709366 + ... + 199709567.
It is an arithmetic number, because the mean of its divisors is an integer number (10185182817).
Almost surely, 240341312233 is an apocalyptic number.
It is an amenable number.
40341312233 is a deficient number, since it is larger than the sum of its proper divisors (399419035).
40341312233 is a wasteful number, since it uses less digits than its factorization.
40341312233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399419034.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 40341312233 its reverse (33221314304), we get a palindrome (73562626537).
The spelling of 40341312233 in words is "forty billion, three hundred forty-one million, three hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •