Base | Representation |
---|---|
bin | 1000110011111101011… |
… | …0010111011100001111 |
3 | 112110202101202022112210 |
4 | 2030333112113130033 |
5 | 4440014442330101 |
6 | 153313542001503 |
7 | 13636334401164 |
oct | 2147726273417 |
9 | 473671668483 |
10 | 151386683151 |
11 | 59225921790 |
12 | 2540b116293 |
13 | 11377947732 |
14 | 74819d806b |
15 | 3e106e37d6 |
hex | 233f59770f |
151386683151 has 64 divisors (see below), whose sum is σ = 224549360640. Its totient is φ = 89959680000.
The previous prime is 151386683131. The next prime is 151386683179.
151386683151 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 151386683151 - 27 = 151386683023 is a prime.
It is a super-2 number, since 2×1513866831512 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 151386683151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151386683131) 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 63 ways as a sum of consecutive naturals, for example, 183944526 + ... + 183945348.
It is an arithmetic number, because the mean of its divisors is an integer number (3508583760).
Almost surely, 2151386683151 is an apocalyptic number.
151386683151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
151386683151 is a deficient number, since it is larger than the sum of its proper divisors (73162677489).
151386683151 is a wasteful number, since it uses less digits than its factorization.
151386683151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1408.
The product of its digits is 518400, while the sum is 48.
The spelling of 151386683151 in words is "one hundred fifty-one billion, three hundred eighty-six million, six hundred eighty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •