Base | Representation |
---|---|
bin | 10000000001101110011… |
… | …011111110101011010111 |
3 | 10220021210222112022200202 |
4 | 100001232123332223113 |
5 | 121021043300044101 |
6 | 2201543154331115 |
7 | 142366560261551 |
oct | 20015633765327 |
9 | 3807728468622 |
10 | 1101364456151 |
11 | 3950a4583103 |
12 | 159550889a9b |
13 | 7cb2069058b |
14 | 3b4407a64d1 |
15 | 1d9b067436b |
hex | 1006e6fead7 |
1101364456151 has 32 divisors (see below), whose sum is σ = 1210511046528. Its totient is φ = 998838466560.
The previous prime is 1101364456139. The next prime is 1101364456183. The reversal of 1101364456151 is 1516544631011.
It is a cyclic number.
It is not a de Polignac number, because 1101364456151 - 210 = 1101364455127 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101364456051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30581411 + ... + 30617403.
It is an arithmetic number, because the mean of its divisors is an integer number (37828470204).
Almost surely, 21101364456151 is an apocalyptic number.
1101364456151 is a deficient number, since it is larger than the sum of its proper divisors (109146590377).
1101364456151 is a wasteful number, since it uses less digits than its factorization.
1101364456151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36971.
The product of its (nonzero) digits is 43200, while the sum is 38.
The spelling of 1101364456151 in words is "one trillion, one hundred one billion, three hundred sixty-four million, four hundred fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •