Base | Representation |
---|---|
bin | 1100000011101… |
… | …11000101001011 |
3 | 21001100000011020 |
4 | 12001313011023 |
5 | 201343313201 |
6 | 14012003523 |
7 | 2335525011 |
oct | 601670513 |
9 | 231300136 |
10 | 101151051 |
11 | 52108311 |
12 | 29a605a3 |
13 | 17c576c1 |
14 | d6108b1 |
15 | 8d30a36 |
hex | 607714b |
101151051 has 4 divisors (see below), whose sum is σ = 134868072. Its totient is φ = 67434032.
The previous prime is 101151013. The next prime is 101151053. The reversal of 101151051 is 150151101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150151101 = 3 ⋅50050367.
It is a cyclic number.
It is not a de Polignac number, because 101151051 - 211 = 101149003 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101151051.
It is not an unprimeable number, because it can be changed into a prime (101151053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16858506 + ... + 16858511.
It is an arithmetic number, because the mean of its divisors is an integer number (33717018).
Almost surely, 2101151051 is an apocalyptic number.
101151051 is a deficient number, since it is larger than the sum of its proper divisors (33717021).
101151051 is an equidigital number, since it uses as much as digits as its factorization.
101151051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33717020.
The product of its (nonzero) digits is 25, while the sum is 15.
The square root of 101151051 is about 10057.3878815525. The cubic root of 101151051 is about 465.9329955176.
Subtracting 101151051 from its reverse (150151101), we obtain a triangular number (49000050 = T9899).
The spelling of 101151051 in words is "one hundred one million, one hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •