Base | Representation |
---|---|
bin | 10010000000001… |
… | …11001001011101 |
3 | 101112011211021200 |
4 | 21000013021131 |
5 | 302130233341 |
6 | 22552550113 |
7 | 3512453565 |
oct | 1100071135 |
9 | 345154250 |
10 | 151024221 |
11 | 78281807 |
12 | 426b2339 |
13 | 2539a15a |
14 | 160b3da5 |
15 | d3d2db6 |
hex | 900725d |
151024221 has 12 divisors (see below), whose sum is σ = 220908480. Its totient is φ = 99407880.
The previous prime is 151024169. The next prime is 151024229. The reversal of 151024221 is 122420151.
It is a de Polignac number, because none of the positive numbers 2k-151024221 is a prime.
It is a super-3 number, since 3×1510242213 (a number of 26 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 151024194 and 151024203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151024229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105495 + ... + 106916.
It is an arithmetic number, because the mean of its divisors is an integer number (18409040).
Almost surely, 2151024221 is an apocalyptic number.
It is an amenable number.
151024221 is a deficient number, since it is larger than the sum of its proper divisors (69884259).
151024221 is a wasteful number, since it uses less digits than its factorization.
151024221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212496 (or 212493 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 151024221 is about 12289.1912264396. The cubic root of 151024221 is about 532.5358727404.
Adding to 151024221 its reverse (122420151), we get a palindrome (273444372).
The spelling of 151024221 in words is "one hundred fifty-one million, twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •