Base | Representation |
---|---|
bin | 10010000001101… |
… | …01001111001111 |
3 | 101112112102020202 |
4 | 21000311033033 |
5 | 302202304012 |
6 | 23001004115 |
7 | 3514201151 |
oct | 1100651717 |
9 | 345472222 |
10 | 151213007 |
11 | 783a0630 |
12 | 4278363b |
13 | 2543506a |
14 | 16122ad1 |
15 | d41dcc2 |
hex | 90353cf |
151213007 has 4 divisors (see below), whose sum is σ = 164959656. Its totient is φ = 137466360.
The previous prime is 151212973. The next prime is 151213019. The reversal of 151213007 is 700312151.
151213007 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 is a cyclic number.
It is not a de Polignac number, because 151213007 - 216 = 151147471 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 151213007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151213057) 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, 6873308 + ... + 6873329.
It is an arithmetic number, because the mean of its divisors is an integer number (41239914).
Almost surely, 2151213007 is an apocalyptic number.
151213007 is a deficient number, since it is larger than the sum of its proper divisors (13746649).
151213007 is a wasteful number, since it uses less digits than its factorization.
151213007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13746648.
The product of its (nonzero) digits is 210, while the sum is 20.
The square root of 151213007 is about 12296.8698049544. The cubic root of 151213007 is about 532.7576770194.
Adding to 151213007 its reverse (700312151), we get a palindrome (851525158).
The spelling of 151213007 in words is "one hundred fifty-one million, two hundred thirteen thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •