Base | Representation |
---|---|
bin | 110011011011000100… |
… | …1111001111000111001 |
3 | 101120001001222000220002 |
4 | 1212312021321320321 |
5 | 3302130114411441 |
6 | 122421515042345 |
7 | 10656364325336 |
oct | 1466611717071 |
9 | 346031860802 |
10 | 110430232121 |
11 | 42918a94950 |
12 | 1949aa403b5 |
13 | a54b695021 |
14 | 54b83b798d |
15 | 2d14c7db9b |
hex | 19b6279e39 |
110430232121 has 8 divisors (see below), whose sum is σ = 120917188800. Its totient is φ = 100017916240.
The previous prime is 110430232117. The next prime is 110430232127. The reversal of 110430232121 is 121232034011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110430232121 - 22 = 110430232117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110430232093 and 110430232102.
It is not an unprimeable number, because it can be changed into a prime (110430232127) 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, 18657101 + ... + 18663018.
It is an arithmetic number, because the mean of its divisors is an integer number (15114648600).
Almost surely, 2110430232121 is an apocalyptic number.
110430232121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110430232121 is a deficient number, since it is larger than the sum of its proper divisors (10486956679).
110430232121 is a wasteful number, since it uses less digits than its factorization.
110430232121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37320399.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 110430232121 its reverse (121232034011), we get a palindrome (231662266132).
The spelling of 110430232121 in words is "one hundred ten billion, four hundred thirty million, two hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •