Base | Representation |
---|---|
bin | 10100010101000101… |
… | …11111001011110101 |
3 | 1001011122022001010101 |
4 | 22022202333023311 |
5 | 134323034041401 |
6 | 5003004354101 |
7 | 534316355446 |
oct | 121242771365 |
9 | 31148261111 |
10 | 10914362101 |
11 | 46a0966875 |
12 | 2147245931 |
13 | 104c272036 |
14 | 75777b2cd |
15 | 43d2c5101 |
hex | 28a8bf2f5 |
10914362101 has 4 divisors (see below), whose sum is σ = 10914588652. Its totient is φ = 10914135552.
The previous prime is 10914362029. The next prime is 10914362111. The reversal of 10914362101 is 10126341901.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7921178001 + 2993184100 = 89001^2 + 54710^2 .
It is a cyclic number.
It is not a de Polignac number, because 10914362101 - 211 = 10914360053 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 10914362101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10914362111) 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 in 3 ways as a sum of consecutive naturals, for example, 9036 + ... + 148021.
It is an arithmetic number, because the mean of its divisors is an integer number (2728647163).
Almost surely, 210914362101 is an apocalyptic number.
It is an amenable number.
10914362101 is a deficient number, since it is larger than the sum of its proper divisors (226551).
10914362101 is an equidigital number, since it uses as much as digits as its factorization.
10914362101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226550.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 10914362101 in words is "ten billion, nine hundred fourteen million, three hundred sixty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •