Base | Representation |
---|---|
bin | 10000111001101000101… |
… | …101101111001100000111 |
3 | 11010000202211012211102222 |
4 | 100321220231233030013 |
5 | 123012020341141101 |
6 | 2245312221322555 |
7 | 146623345014200 |
oct | 20715055571407 |
9 | 4100684184388 |
10 | 1161397990151 |
11 | 408600984813 |
12 | 169105a0645b |
13 | 8569a05c169 |
14 | 402d78a85a7 |
15 | 20325ced01b |
hex | 10e68b6f307 |
1161397990151 has 12 divisors (see below), whose sum is σ = 1351143830952. Its totient is φ = 995388318288.
The previous prime is 1161397990063. The next prime is 1161397990163. The reversal of 1161397990151 is 1510997931611.
It is a happy number.
It is not a de Polignac number, because 1161397990151 - 226 = 1161330881287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1161397990093 and 1161397990102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1161397990651) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 621545 + ... + 1645938.
It is an arithmetic number, because the mean of its divisors is an integer number (112595319246).
Almost surely, 21161397990151 is an apocalyptic number.
1161397990151 is a deficient number, since it is larger than the sum of its proper divisors (189745840801).
1161397990151 is a wasteful number, since it uses less digits than its factorization.
1161397990151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2277950 (or 2277943 counting only the distinct ones).
The product of its (nonzero) digits is 459270, while the sum is 53.
The spelling of 1161397990151 in words is "one trillion, one hundred sixty-one billion, three hundred ninety-seven million, nine hundred ninety thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •