Base | Representation |
---|---|
bin | 1000110100011000101… |
… | …1101101011001110010 |
3 | 112111001101110222111122 |
4 | 2031012023231121302 |
5 | 4440233320030114 |
6 | 153333155142242 |
7 | 13642226025515 |
oct | 2150613553162 |
9 | 474041428448 |
10 | 151501330034 |
11 | 5928460767a |
12 | 254415a4982 |
13 | 11395618c22 |
14 | 7492d1cd7c |
15 | 3e1a7dce8e |
hex | 23462ed672 |
151501330034 has 4 divisors (see below), whose sum is σ = 227251995054. Its totient is φ = 75750665016.
The previous prime is 151501329983. The next prime is 151501330039. The reversal of 151501330034 is 430033105151.
151501330034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 83743678225 + 67757651809 = 289385^2 + 260303^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 151501329985 and 151501330012.
It is not an unprimeable number, because it can be changed into a prime (151501330039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37875332507 + ... + 37875332510.
Almost surely, 2151501330034 is an apocalyptic number.
151501330034 is a deficient number, since it is larger than the sum of its proper divisors (75750665020).
151501330034 is an equidigital number, since it uses as much as digits as its factorization.
151501330034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75750665019.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 151501330034 its reverse (430033105151), we get a palindrome (581534435185).
The spelling of 151501330034 in words is "one hundred fifty-one billion, five hundred one million, three hundred thirty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •