Base | Representation |
---|---|
bin | 11010010011010111… |
… | …10001110110010110 |
3 | 1100110010100222011101 |
4 | 31021223301312112 |
5 | 212410001140110 |
6 | 10253120300314 |
7 | 1006635332401 |
oct | 151153616626 |
9 | 40403328141 |
10 | 14121115030 |
11 | 5a97001800 |
12 | 28a117169a |
13 | 1440736489 |
14 | 97d602d38 |
15 | 579aa913a |
hex | 349af1d96 |
14121115030 has 24 divisors (see below), whose sum is σ = 27938803536. Its totient is φ = 5134950480.
The previous prime is 14121115003. The next prime is 14121115031. The reversal of 14121115030 is 3051112141.
It is a junction number, because it is equal to n+sod(n) for n = 14121114989 and 14121115007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14121115031) 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 11 ways as a sum of consecutive naturals, for example, 5833962 + ... + 5836381.
It is an arithmetic number, because the mean of its divisors is an integer number (1164116814).
Almost surely, 214121115030 is an apocalyptic number.
14121115030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14121115030 is a deficient number, since it is larger than the sum of its proper divisors (13817688506).
14121115030 is a wasteful number, since it uses less digits than its factorization.
14121115030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11670372 (or 11670361 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 14121115030 its reverse (3051112141), we get a palindrome (17172227171).
It can be divided in two parts, 1412111 and 5030, that added together give a palindrome (1417141).
The spelling of 14121115030 in words is "fourteen billion, one hundred twenty-one million, one hundred fifteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •