Base | Representation |
---|---|
bin | 100010011010100110000011… |
… | …111001011001011011111111 |
3 | 201211220222121011101101222110 |
4 | 202122212003321121123333 |
5 | 124314400121231340111 |
6 | 1253530204350545103 |
7 | 43611324350224050 |
oct | 4232460371313377 |
9 | 654828534341873 |
10 | 151361155340031 |
11 | 442569a623758a |
12 | 14b86980808193 |
13 | 665c3ac879090 |
14 | 2953cc1a80727 |
15 | 12773b72205a6 |
hex | 89a983e596ff |
151361155340031 has 256 divisors, whose sum is σ = 277784419368960. Its totient is φ = 71039811870720.
The previous prime is 151361155340027. The next prime is 151361155340051. The reversal of 151361155340031 is 130043551163151.
It is not a de Polignac number, because 151361155340031 - 22 = 151361155340027 is a prime.
It is a super-2 number, since 2×1513611553400312 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151361155340051) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 1505866066 + ... + 1505966576.
It is an arithmetic number, because the mean of its divisors is an integer number (1085095388160).
Almost surely, 2151361155340031 is an apocalyptic number.
151361155340031 is a deficient number, since it is larger than the sum of its proper divisors (126423264028929).
151361155340031 is a wasteful number, since it uses less digits than its factorization.
151361155340031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100814.
The product of its (nonzero) digits is 81000, while the sum is 39.
The spelling of 151361155340031 in words is "one hundred fifty-one trillion, three hundred sixty-one billion, one hundred fifty-five million, three hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •