Base | Representation |
---|---|
bin | 100001101011110… |
… | …0101010010010001 |
3 | 2220202202221002000 |
4 | 1003113211102101 |
5 | 4303321134010 |
6 | 304053144213 |
7 | 40003004361 |
oct | 10327452221 |
9 | 2822687060 |
10 | 1130255505 |
11 | 52aaaa765 |
12 | 27662b069 |
13 | 150215052 |
14 | aa1769a1 |
15 | 693607c0 |
hex | 435e5491 |
1130255505 has 32 divisors (see below), whose sum is σ = 2074168320. Its totient is φ = 583355520.
The previous prime is 1130255479. The next prime is 1130255509. The reversal of 1130255505 is 5055520311.
1130255505 is a `hidden beast` number, since 1 + 130 + 25 + 5 + 505 = 666.
It is not a de Polignac number, because 1130255505 - 28 = 1130255249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1130255509) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 130852 + ... + 139221.
It is an arithmetic number, because the mean of its divisors is an integer number (64817760).
Almost surely, 21130255505 is an apocalyptic number.
1130255505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1130255505 is a deficient number, since it is larger than the sum of its proper divisors (943912815).
1130255505 is a wasteful number, since it uses less digits than its factorization.
1130255505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270118 (or 270112 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 1130255505 is about 33619.2728208092. The cubic root of 1130255505 is about 1041.6589355231.
Adding to 1130255505 its reverse (5055520311), we get a palindrome (6185775816).
The spelling of 1130255505 in words is "one billion, one hundred thirty million, two hundred fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •