Base | Representation |
---|---|
bin | 11010001011010111… |
… | …11010001000111001 |
3 | 1100021110011012200111 |
4 | 31011223322020321 |
5 | 212240313240441 |
6 | 10242322504321 |
7 | 1005162240622 |
oct | 150553721071 |
9 | 40243135614 |
10 | 14054040121 |
11 | 5a621593a0 |
12 | 28828050a1 |
13 | 142c880194 |
14 | 974742a49 |
15 | 573c5a081 |
hex | 345afa239 |
14054040121 has 4 divisors (see below), whose sum is σ = 15331680144. Its totient is φ = 12776400100.
The previous prime is 14054040089. The next prime is 14054040127. The reversal of 14054040121 is 12104045041.
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.
It is a cyclic number.
It is not a de Polignac number, because 14054040121 - 25 = 14054040089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14054040092 and 14054040101.
It is not an unprimeable number, because it can be changed into a prime (14054040127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 638819995 + ... + 638820016.
It is an arithmetic number, because the mean of its divisors is an integer number (3832920036).
Almost surely, 214054040121 is an apocalyptic number.
14054040121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14054040121 is a deficient number, since it is larger than the sum of its proper divisors (1277640023).
14054040121 is a wasteful number, since it uses less digits than its factorization.
14054040121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1277640022.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 14054040121 its reverse (12104045041), we get a palindrome (26158085162).
The spelling of 14054040121 in words is "fourteen billion, fifty-four million, forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •