Base | Representation |
---|---|
bin | 11010001011000011… |
… | …10110010110010001 |
3 | 1100021021012020110000 |
4 | 31011201312112101 |
5 | 212234124400103 |
6 | 10242150200213 |
7 | 1005130645644 |
oct | 150541662621 |
9 | 40237166400 |
10 | 14051403153 |
11 | 5a60718187 |
12 | 2881953069 |
13 | 142c168b48 |
14 | 974257a5b |
15 | 5738d8aa3 |
hex | 345876591 |
14051403153 has 20 divisors (see below), whose sum is σ = 21010132660. Its totient is φ = 9358781472.
The previous prime is 14051403137. The next prime is 14051403167. The reversal of 14051403153 is 35130415041.
It is a happy number.
14051403153 is a `hidden beast` number, since 140 + 514 + 0 + 3 + 1 + 5 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3288793104 + 10762610049 = 57348^2 + 103743^2 .
It is not a de Polignac number, because 14051403153 - 24 = 14051403137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14051403173) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5451 + ... + 167727.
It is an arithmetic number, because the mean of its divisors is an integer number (1050506633).
Almost surely, 214051403153 is an apocalyptic number.
It is an amenable number.
14051403153 is a deficient number, since it is larger than the sum of its proper divisors (6958729507).
14051403153 is a wasteful number, since it uses less digits than its factorization.
14051403153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163358 (or 163349 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 14051403153 its reverse (35130415041), we get a palindrome (49181818194).
The spelling of 14051403153 in words is "fourteen billion, fifty-one million, four hundred three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •