Base | Representation |
---|---|
bin | 10010110101101101… |
… | …00111010110101001 |
3 | 222002212122122110002 |
4 | 21122312213112221 |
5 | 131203213413001 |
6 | 4351342232345 |
7 | 505432201322 |
oct | 113266472651 |
9 | 28085578402 |
10 | 10114201001 |
11 | 4320225a03 |
12 | 1b632856b5 |
13 | c52563a28 |
14 | 6bd3ad449 |
15 | 3e2e1a46b |
hex | 25ada75a9 |
10114201001 has 4 divisors (see below), whose sum is σ = 10208726352. Its totient is φ = 10019675652.
The previous prime is 10114200959. The next prime is 10114201003. The reversal of 10114201001 is 10010241101.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10010241101 = 7 ⋅1430034443.
It is a cyclic number.
It is not a de Polignac number, because 10114201001 - 26 = 10114200937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10114201003) 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, 47262515 + ... + 47262728.
It is an arithmetic number, because the mean of its divisors is an integer number (2552181588).
Almost surely, 210114201001 is an apocalyptic number.
It is an amenable number.
10114201001 is a deficient number, since it is larger than the sum of its proper divisors (94525351).
10114201001 is an equidigital number, since it uses as much as digits as its factorization.
10114201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94525350.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10114201001 its reverse (10010241101), we get a palindrome (20124442102).
The spelling of 10114201001 in words is "ten billion, one hundred fourteen million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •