Base | Representation |
---|---|
bin | 110011010101000111… |
… | …0001000010110010101 |
3 | 101112112010012212100102 |
4 | 1212222032020112111 |
5 | 3301222340411313 |
6 | 122350003423445 |
7 | 10651413440156 |
oct | 1465216102625 |
9 | 345463185312 |
10 | 110230013333 |
11 | 42825a72580 |
12 | 19443984b85 |
13 | a51906227b |
14 | 549997992d |
15 | 2d023cea58 |
hex | 19aa388595 |
110230013333 has 4 divisors (see below), whose sum is σ = 120250923648. Its totient is φ = 100209103020.
The previous prime is 110230013323. The next prime is 110230013353. The reversal of 110230013333 is 333310032011.
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 110230013333 - 230 = 109156271509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110230013323) 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, 5010455141 + ... + 5010455162.
It is an arithmetic number, because the mean of its divisors is an integer number (30062730912).
Almost surely, 2110230013333 is an apocalyptic number.
It is an amenable number.
110230013333 is a deficient number, since it is larger than the sum of its proper divisors (10020910315).
110230013333 is a wasteful number, since it uses less digits than its factorization.
110230013333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10020910314.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 110230013333 its reverse (333310032011), we get a palindrome (443540045344).
The spelling of 110230013333 in words is "one hundred ten billion, two hundred thirty million, thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •