Base | Representation |
---|---|
bin | 1000110011011000111… |
… | …1111101110011110001 |
3 | 112110100202110201211201 |
4 | 2030312033331303301 |
5 | 4434211401312403 |
6 | 153250445411201 |
7 | 13632501610036 |
oct | 2146617756361 |
9 | 473322421751 |
10 | 151234010353 |
11 | 59157724418 |
12 | 25387b69b01 |
13 | 113521210ba |
14 | 746961538d |
15 | 3e020d721d |
hex | 23363fdcf1 |
151234010353 has 4 divisors (see below), whose sum is σ = 156112526848. Its totient is φ = 146355493860.
The previous prime is 151234010321. The next prime is 151234010371. The reversal of 151234010353 is 353010432151.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 151234010353 - 25 = 151234010321 is a prime.
It is a super-2 number, since 2×1512340103532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151234010153) 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 3 ways as a sum of consecutive naturals, for example, 2439258201 + ... + 2439258262.
It is an arithmetic number, because the mean of its divisors is an integer number (39028131712).
Almost surely, 2151234010353 is an apocalyptic number.
It is an amenable number.
151234010353 is a deficient number, since it is larger than the sum of its proper divisors (4878516495).
151234010353 is an equidigital number, since it uses as much as digits as its factorization.
151234010353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4878516494.
The product of its (nonzero) digits is 5400, while the sum is 28.
The spelling of 151234010353 in words is "one hundred fifty-one billion, two hundred thirty-four million, ten thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •