Base | Representation |
---|---|
bin | 11010001011000010… |
… | …01111000110111111 |
3 | 1100021020220001222100 |
4 | 31011201033012333 |
5 | 212234104224211 |
6 | 10242142520143 |
7 | 1005126406242 |
oct | 150541170677 |
9 | 40236801870 |
10 | 14051242431 |
11 | 5a60618456 |
12 | 2881896053 |
13 | 142c110945 |
14 | 974215259 |
15 | 5738a6156 |
hex | 34584f1bf |
14051242431 has 12 divisors (see below), whose sum is σ = 20316609352. Its totient is φ = 9358093296.
The previous prime is 14051242423. The next prime is 14051242451. The reversal of 14051242431 is 13424215041.
14051242431 is a `hidden beast` number, since 1 + 405 + 12 + 4 + 243 + 1 = 666.
It is not a de Polignac number, because 14051242431 - 23 = 14051242423 is a prime.
It is a super-2 number, since 2×140512424312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14051242395 and 14051242404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14051242451) 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, 774001 + ... + 791946.
Almost surely, 214051242431 is an apocalyptic number.
14051242431 is a deficient number, since it is larger than the sum of its proper divisors (6265366921).
14051242431 is a wasteful number, since it uses less digits than its factorization.
14051242431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566950 (or 1566947 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 14051242431 its reverse (13424215041), we get a palindrome (27475457472).
The spelling of 14051242431 in words is "fourteen billion, fifty-one million, two hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •