Base | Representation |
---|---|
bin | 10000000000101010110… |
… | …101001110010111100011 |
3 | 10220011212221021022202210 |
4 | 100000222311032113203 |
5 | 121011232414121311 |
6 | 2201234440013203 |
7 | 142326505410411 |
oct | 20005265162743 |
9 | 3804787238683 |
10 | 1100230223331 |
11 | 394672307208 |
12 | 159294a61203 |
13 | 7c99c6b50b5 |
14 | 3b373cb62b1 |
15 | 1d945cca3a6 |
hex | 1002ad4e5e3 |
1100230223331 has 8 divisors (see below), whose sum is σ = 1467429650704. Its totient is φ = 733258805760.
The previous prime is 1100230223299. The next prime is 1100230223357. The reversal of 1100230223331 is 1333220320011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100230223331 - 25 = 1100230223299 is a prime.
It is a super-2 number, since 2×11002302233312 (a number of 25 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 = 1100230223298 and 1100230223307.
It is not an unprimeable number, because it can be changed into a prime (1100230233331) 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, 56991190 + ... + 57010491.
It is an arithmetic number, because the mean of its divisors is an integer number (183428706338).
Almost surely, 21100230223331 is an apocalyptic number.
1100230223331 is a deficient number, since it is larger than the sum of its proper divisors (367199427373).
1100230223331 is a wasteful number, since it uses less digits than its factorization.
1100230223331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114004901.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1100230223331 its reverse (1333220320011), we get a palindrome (2433450543342).
The spelling of 1100230223331 in words is "one trillion, one hundred billion, two hundred thirty million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •