Base | Representation |
---|---|
bin | 100001011001011… |
… | …1101101100011001 |
3 | 2220002201020020110 |
4 | 1002302331230121 |
5 | 4243341444103 |
6 | 303111314533 |
7 | 36525264051 |
oct | 10262755431 |
9 | 2802636213 |
10 | 1120656153 |
11 | 525643611 |
12 | 27337ba49 |
13 | 14b233966 |
14 | a8b98561 |
15 | 685b6403 |
hex | 42cbdb19 |
1120656153 has 16 divisors (see below), whose sum is σ = 1533188096. Its totient is φ = 727710480.
The previous prime is 1120656151. The next prime is 1120656161. The reversal of 1120656153 is 3516560211.
1120656153 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
1120656153 is a nontrivial binomial coefficient, being equal to C(47343, 2).
It is not a de Polignac number, because 1120656153 - 21 = 1120656151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1120656153.
It is not an unprimeable number, because it can be changed into a prime (1120656151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35508 + ... + 59178.
It is an arithmetic number, because the mean of its divisors is an integer number (95824256).
Almost surely, 21120656153 is an apocalyptic number.
1120656153 is the 47342-nd triangular number.
It is an amenable number.
1120656153 is a deficient number, since it is larger than the sum of its proper divisors (412531943).
1120656153 is a wasteful number, since it uses less digits than its factorization.
1120656153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24084.
The product of its (nonzero) digits is 5400, while the sum is 30.
The square root of 1120656153 is about 33476.2027864571. The cubic root of 1120656153 is about 1038.7015825996.
The spelling of 1120656153 in words is "one billion, one hundred twenty million, six hundred fifty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •