Base | Representation |
---|---|
bin | 111110111001000… |
… | …000001010011011 |
3 | 2201112102011121210 |
4 | 332321000022123 |
5 | 4130103132032 |
6 | 252411034203 |
7 | 35101313352 |
oct | 7671001233 |
9 | 2645364553 |
10 | 1055130267 |
11 | 4a1658a94 |
12 | 25543b963 |
13 | 13a7a0749 |
14 | a01bc999 |
15 | 629712cc |
hex | 3ee4029b |
1055130267 has 8 divisors (see below), whose sum is σ = 1468007424. Its totient is φ = 672836648.
The previous prime is 1055130257. The next prime is 1055130299. The reversal of 1055130267 is 7620315501.
1055130267 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1055130267 - 215 = 1055097499 is a prime.
It is a super-2 number, since 2×10551302672 = 2226599760678982578, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1055130257) 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, 7645803 + ... + 7645940.
It is an arithmetic number, because the mean of its divisors is an integer number (183500928).
Almost surely, 21055130267 is an apocalyptic number.
1055130267 is a deficient number, since it is larger than the sum of its proper divisors (412877157).
1055130267 is a wasteful number, since it uses less digits than its factorization.
1055130267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15291769.
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 1055130267 is about 32482.7687705343. The cubic root of 1055130267 is about 1018.0490283151.
Adding to 1055130267 its reverse (7620315501), we get a palindrome (8675445768).
The spelling of 1055130267 in words is "one billion, fifty-five million, one hundred thirty thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •