Base | Representation |
---|---|
bin | 100000110010111… |
… | …0010000010100010 |
3 | 2211200122022000122 |
4 | 1001211302002202 |
5 | 4223202021310 |
6 | 301105520242 |
7 | 36161305166 |
oct | 10145620242 |
9 | 2750568018 |
10 | 1100423330 |
11 | 515184376 |
12 | 268643082 |
13 | 146c9b586 |
14 | a620cca6 |
15 | 6691b555 |
hex | 419720a2 |
1100423330 has 8 divisors (see below), whose sum is σ = 1980762012. Its totient is φ = 440169328.
The previous prime is 1100423329. The next prime is 1100423333. The reversal of 1100423330 is 333240011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1097795689 + 2627641 = 33133^2 + 1621^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1100423299 and 1100423308.
It is not an unprimeable number, because it can be changed into a prime (1100423333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55021157 + ... + 55021176.
Almost surely, 21100423330 is an apocalyptic number.
1100423330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100423330 is a deficient number, since it is larger than the sum of its proper divisors (880338682).
1100423330 is a wasteful number, since it uses less digits than its factorization.
1100423330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110042340.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 1100423330 is about 33172.6292295320. The cubic root of 1100423330 is about 1032.4125212426.
Adding to 1100423330 its reverse (333240011), we get a palindrome (1433663341).
The spelling of 1100423330 in words is "one billion, one hundred million, four hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •