Base | Representation |
---|---|
bin | 1101100100001001000… |
… | …1111110101011100111 |
3 | 211021111222022221211002 |
4 | 3121002101332223213 |
5 | 12304231300242211 |
6 | 255020205103515 |
7 | 22556645246222 |
oct | 3310221765347 |
9 | 737458287732 |
10 | 233040243431 |
11 | 8a917162106 |
12 | 391b8857b9b |
13 | 18c8b519088 |
14 | b3ca20a5b9 |
15 | 60dde4103b |
hex | 364247eae7 |
233040243431 has 8 divisors (see below), whose sum is σ = 243292443264. Its totient is φ = 222798044920.
The previous prime is 233040243419. The next prime is 233040243433. The reversal of 233040243431 is 134342040332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 233040243431 - 214 = 233040227047 is a prime.
It is a super-2 number, since 2×2330402434312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233040243394 and 233040243403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233040243433) 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, 2452685 + ... + 2545926.
It is an arithmetic number, because the mean of its divisors is an integer number (30411555408).
Almost surely, 2233040243431 is an apocalyptic number.
233040243431 is a deficient number, since it is larger than the sum of its proper divisors (10252199833).
233040243431 is a wasteful number, since it uses less digits than its factorization.
233040243431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5000661.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 233040243431 its reverse (134342040332), we get a palindrome (367382283763).
The spelling of 233040243431 in words is "two hundred thirty-three billion, forty million, two hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •