Base | Representation |
---|---|
bin | 10000101001011011101… |
… | …110100011101100101001 |
3 | 11001100212100021011020121 |
4 | 100221123232203230221 |
5 | 122220403024412413 |
6 | 2233314011123241 |
7 | 145436251346665 |
oct | 20513356435451 |
9 | 4040770234217 |
10 | 1144000232233 |
11 | 401193341791 |
12 | 16586b443521 |
13 | 83b56830b51 |
14 | 3d5270498a5 |
15 | 1eb58756b8d |
hex | 10a5bba3b29 |
1144000232233 has 4 divisors (see below), whose sum is σ = 1144177575568. Its totient is φ = 1143822888900.
The previous prime is 1144000232189. The next prime is 1144000232257. The reversal of 1144000232233 is 3322320004411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1144000232233 - 225 = 1143966677801 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1144000232198 and 1144000232207.
It is not an unprimeable number, because it can be changed into a prime (1144000232833) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88661991 + ... + 88674892.
It is an arithmetic number, because the mean of its divisors is an integer number (286044393892).
Almost surely, 21144000232233 is an apocalyptic number.
It is an amenable number.
1144000232233 is a deficient number, since it is larger than the sum of its proper divisors (177343335).
1144000232233 is an equidigital number, since it uses as much as digits as its factorization.
1144000232233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177343334.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 1144000232233 its reverse (3322320004411), we get a palindrome (4466320236644).
The spelling of 1144000232233 in words is "one trillion, one hundred forty-four billion, two hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •