Base | Representation |
---|---|
bin | 110011001111001010… |
… | …0010010001110000001 |
3 | 101112000012102101012112 |
4 | 1212132110102032001 |
5 | 3300320224100113 |
6 | 122314111105105 |
7 | 10643440055513 |
oct | 1463624221601 |
9 | 345005371175 |
10 | 110030300033 |
11 | 42733265a65 |
12 | 193a8b12195 |
13 | a4b6878614 |
14 | 547b22dbb3 |
15 | 2cdead05a8 |
hex | 199e512381 |
110030300033 has 8 divisors (see below), whose sum is σ = 113897788200. Its totient is φ = 106167701248.
The previous prime is 110030299987. The next prime is 110030300053. The reversal of 110030300033 is 330003030011.
It can be written as a sum of positive squares in 4 ways, for example, as 9222145024 + 100808155009 = 96032^2 + 317503^2 .
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 110030300033 - 28 = 110030299777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110030299990 and 110030300017.
It is not an unprimeable number, because it can be changed into a prime (110030300053) 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, 1176518 + ... + 1266591.
It is an arithmetic number, because the mean of its divisors is an integer number (14237223525).
Almost surely, 2110030300033 is an apocalyptic number.
It is an amenable number.
110030300033 is a deficient number, since it is larger than the sum of its proper divisors (3867488167).
110030300033 is a wasteful number, since it uses less digits than its factorization.
110030300033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2444691.
The product of its (nonzero) digits is 81, while the sum is 14.
Adding to 110030300033 its reverse (330003030011), we get a palindrome (440033330044).
The spelling of 110030300033 in words is "one hundred ten billion, thirty million, three hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •