Base | Representation |
---|---|
bin | 10110100111110000… |
… | …01100010010001111 |
3 | 1011100101022112012112 |
4 | 23103320030102033 |
5 | 144333013020201 |
6 | 5325034054235 |
7 | 606645612605 |
oct | 132370142217 |
9 | 34311275175 |
10 | 12144657551 |
11 | 5172384a74 |
12 | 242b27a37b |
13 | 11b7112b00 |
14 | 832d15875 |
15 | 4b12e70bb |
hex | 2d3e0c48f |
12144657551 has 12 divisors (see below), whose sum is σ = 13179583872. Its totient is φ = 11185851456.
The previous prime is 12144657521. The next prime is 12144657563. The reversal of 12144657551 is 15575644121.
12144657551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-12144657551 is a prime.
It is a super-2 number, since 2×121446575512 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12144657499 and 12144657508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12144657521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1391 + ... + 155856.
It is an arithmetic number, because the mean of its divisors is an integer number (1098298656).
Almost surely, 212144657551 is an apocalyptic number.
12144657551 is a deficient number, since it is larger than the sum of its proper divisors (1034926321).
12144657551 is a wasteful number, since it uses less digits than its factorization.
12144657551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157730 (or 157717 counting only the distinct ones).
The product of its digits is 168000, while the sum is 41.
The spelling of 12144657551 in words is "twelve billion, one hundred forty-four million, six hundred fifty-seven thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •