Base | Representation |
---|---|
bin | 11010010101101001… |
… | …01100100110100011 |
3 | 1100111110100010001010 |
4 | 31022310230212203 |
5 | 212424344330201 |
6 | 10255042112003 |
7 | 1010256654333 |
oct | 151264544643 |
9 | 40443303033 |
10 | 14140230051 |
11 | 5aa6878142 |
12 | 28a764b603 |
13 | 1444699b3c |
14 | 981d7b0c3 |
15 | 57b5d2bd6 |
hex | 34ad2c9a3 |
14140230051 has 8 divisors (see below), whose sum is σ = 18855138384. Its totient is φ = 9426070880.
The previous prime is 14140230017. The next prime is 14140230079. The reversal of 14140230051 is 15003204141.
14140230051 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 not a de Polignac number, because 14140230051 - 29 = 14140229539 is a prime.
It is a super-2 number, since 2×141402300512 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14140230151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141660 + ... + 219881.
It is an arithmetic number, because the mean of its divisors is an integer number (2356892298).
Almost surely, 214140230051 is an apocalyptic number.
14140230051 is a deficient number, since it is larger than the sum of its proper divisors (4714908333).
14140230051 is a wasteful number, since it uses less digits than its factorization.
14140230051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374581.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 14140230051 its reverse (15003204141), we get a palindrome (29143434192).
The spelling of 14140230051 in words is "fourteen billion, one hundred forty million, two hundred thirty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •