Base | Representation |
---|---|
bin | 1100101111000100010000… |
… | …1000000010110111010011 |
3 | 1211120122111202211122210021 |
4 | 3023301010020002313103 |
5 | 3313410101001011111 |
6 | 45440433540244311 |
7 | 2643443601035314 |
oct | 313610410026723 |
9 | 54518452748707 |
10 | 14002736344531 |
11 | 4509588685850 |
12 | 16a19a80a0697 |
13 | 7a75b5b2441c |
14 | 365a43a4260b |
15 | 19439b261d71 |
hex | cbc44202dd3 |
14002736344531 has 16 divisors (see below), whose sum is σ = 15352859001600. Its totient is φ = 12665474664480.
The previous prime is 14002736344517. The next prime is 14002736344549. The reversal of 14002736344531 is 13544363720041.
It is not a de Polignac number, because 14002736344531 - 221 = 14002734247379 is a prime.
It is a super-2 number, since 2×140027363445312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14002736344561) 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 15 ways as a sum of consecutive naturals, for example, 167782345 + ... + 167865781.
It is an arithmetic number, because the mean of its divisors is an integer number (959553687600).
Almost surely, 214002736344531 is an apocalyptic number.
14002736344531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14002736344531 is a deficient number, since it is larger than the sum of its proper divisors (1350122657069).
14002736344531 is a wasteful number, since it uses less digits than its factorization.
14002736344531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160314.
The product of its (nonzero) digits is 725760, while the sum is 43.
The spelling of 14002736344531 in words is "fourteen trillion, two billion, seven hundred thirty-six million, three hundred forty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •