Base | Representation |
---|---|
bin | 101000000101… |
… | …0011001101011 |
3 | 1110112121221212 |
4 | 1100022121223 |
5 | 20334422443 |
6 | 2030223335 |
7 | 343421444 |
oct | 120123153 |
9 | 43477855 |
10 | 21014123 |
11 | 10953249 |
12 | 7054b4b |
13 | 4479bc0 |
14 | 2b102cb |
15 | 1ca1618 |
hex | 140a66b |
21014123 has 16 divisors (see below), whose sum is σ = 23364096. Its totient is φ = 18779040.
The previous prime is 21014101. The next prime is 21014131. The reversal of 21014123 is 32141012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21014123 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21014098 and 21014107.
It is not an unprimeable number, because it can be changed into a prime (21016123) 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 15 ways as a sum of consecutive naturals, for example, 99488 + ... + 99698.
It is an arithmetic number, because the mean of its divisors is an integer number (1460256).
Almost surely, 221014123 is an apocalyptic number.
21014123 is a deficient number, since it is larger than the sum of its proper divisors (2349973).
21014123 is a wasteful number, since it uses less digits than its factorization.
21014123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 21014123 is about 4584.1163815942. The cubic root of 21014123 is about 275.9542518518.
Adding to 21014123 its reverse (32141012), we get a palindrome (53155135).
It can be divided in two parts, 210 and 14123, that multiplied together give a triangular number (2965830 = T2435).
The spelling of 21014123 in words is "twenty-one million, fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.244 sec. • engine limits •