Base | Representation |
---|---|
bin | 11010010100011011… |
… | …10101100111000111 |
3 | 1100110202011120111100 |
4 | 31022031311213013 |
5 | 212414242341320 |
6 | 10254035511143 |
7 | 1010104246422 |
oct | 151215654707 |
9 | 40422146440 |
10 | 14130043335 |
11 | 5aa104a771 |
12 | 28a41584b3 |
13 | 14425412b5 |
14 | 9808889b9 |
15 | 57a76e790 |
hex | 34a3759c7 |
14130043335 has 24 divisors (see below), whose sum is σ = 24495460704. Its totient is φ = 7534981440.
The previous prime is 14130043327. The next prime is 14130043339. The reversal of 14130043335 is 53334003141.
It is not a de Polignac number, because 14130043335 - 23 = 14130043327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14130043299 and 14130043308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14130043339) 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 23 ways as a sum of consecutive naturals, for example, 395670 + ... + 429900.
It is an arithmetic number, because the mean of its divisors is an integer number (1020644196).
Almost surely, 214130043335 is an apocalyptic number.
14130043335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14130043335 is a deficient number, since it is larger than the sum of its proper divisors (10365417369).
14130043335 is a wasteful number, since it uses less digits than its factorization.
14130043335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43415 (or 43412 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 14130043335 its reverse (53334003141), we get a palindrome (67464046476).
The spelling of 14130043335 in words is "fourteen billion, one hundred thirty million, forty-three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •