Base | Representation |
---|---|
bin | 100000110010000… |
… | …1010101101110011 |
3 | 2211122211210111000 |
4 | 1001210022231303 |
5 | 4223100000430 |
6 | 301052453043 |
7 | 36154563264 |
oct | 10144125563 |
9 | 2748753430 |
10 | 1100000115 |
11 | 514a15405 |
12 | 26847a183 |
13 | 146b80a56 |
14 | a613c96b |
15 | 66885e60 |
hex | 4190ab73 |
1100000115 has 32 divisors (see below), whose sum is σ = 1956951360. Its totient is φ = 586248192.
The previous prime is 1100000081. The next prime is 1100000123. The reversal of 1100000115 is 5110000011.
It is not a de Polignac number, because 1100000115 - 26 = 1100000051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1100000097 and 1100000106.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 316467 + ... + 319923.
It is an arithmetic number, because the mean of its divisors is an integer number (61154730).
Almost surely, 21100000115 is an apocalyptic number.
1100000115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1100000115 is a deficient number, since it is larger than the sum of its proper divisors (856951245).
1100000115 is a wasteful number, since it uses less digits than its factorization.
1100000115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5828 (or 5822 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
The square root of 1100000115 is about 33166.2496372442. The cubic root of 1100000115 is about 1032.2801514298.
Adding to 1100000115 its reverse (5110000011), we get a palindrome (6210000126).
It can be divided in two parts, 110000011 and 5, that multiplied together give a palindrome (550000055).
The spelling of 1100000115 in words is "one billion, one hundred million, one hundred fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •