Base | Representation |
---|---|
bin | 1000110100110011000… |
… | …1111101010100111111 |
3 | 112111100002202121122011 |
4 | 2031030301331110333 |
5 | 4441000134120111 |
6 | 153352151432051 |
7 | 13645041623053 |
oct | 2151461752477 |
9 | 474302677564 |
10 | 151612020031 |
11 | 5933103a70a |
12 | 25472685627 |
13 | 113b2533374 |
14 | 74a38d3c63 |
15 | 3e253a5021 |
hex | 234cc7d53f |
151612020031 has 4 divisors (see below), whose sum is σ = 155709642232. Its totient is φ = 147514397832.
The previous prime is 151612019987. The next prime is 151612020037. The reversal of 151612020031 is 130020216151.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 151612020031 - 27 = 151612019903 is a prime.
It is a super-2 number, since 2×1516120200312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151612019984 and 151612020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151612020037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2048811045 + ... + 2048811118.
It is an arithmetic number, because the mean of its divisors is an integer number (38927410558).
Almost surely, 2151612020031 is an apocalyptic number.
151612020031 is a deficient number, since it is larger than the sum of its proper divisors (4097622201).
151612020031 is an equidigital number, since it uses as much as digits as its factorization.
151612020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4097622200.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 151612020031 its reverse (130020216151), we get a palindrome (281632236182).
The spelling of 151612020031 in words is "one hundred fifty-one billion, six hundred twelve million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •