Base | Representation |
---|---|
bin | 11110001010010… |
… | …11000001010111 |
3 | 122122002110002201 |
4 | 33011023001113 |
5 | 1004232422403 |
6 | 41034545331 |
7 | 6161404306 |
oct | 1705130127 |
9 | 578073081 |
10 | 253014103 |
11 | 11a902271 |
12 | 70898247 |
13 | 405595b4 |
14 | 2586243d |
15 | 1732c21d |
hex | f14b057 |
253014103 has 8 divisors (see below), whose sum is σ = 264757248. Its totient is φ = 241529184.
The previous prime is 253014061. The next prime is 253014133. The reversal of 253014103 is 301410352.
253014103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-253014103 is a prime.
It is a super-2 number, since 2×2530141032 = 128032272633789218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253014133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62551 + ... + 66472.
It is an arithmetic number, because the mean of its divisors is an integer number (33094656).
Almost surely, 2253014103 is an apocalyptic number.
253014103 is a deficient number, since it is larger than the sum of its proper divisors (11743145).
253014103 is a wasteful number, since it uses less digits than its factorization.
253014103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129113.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 253014103 is about 15906.4170384157. The cubic root of 253014103 is about 632.4821060725.
Adding to 253014103 its reverse (301410352), we get a palindrome (554424455).
The spelling of 253014103 in words is "two hundred fifty-three million, fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •