Base | Representation |
---|---|
bin | 1100110000111100100001… |
… | …1010010111110010011101 |
3 | 1211200201211201012022102211 |
4 | 3030033020122113302131 |
5 | 3314422210222344123 |
6 | 45503333250120421 |
7 | 2645665614655615 |
oct | 314171032276235 |
9 | 54621751168384 |
10 | 14035020512413 |
11 | 4521245206a2a |
12 | 16a80b7b80111 |
13 | 7aa65c4aa344 |
14 | 367427597a45 |
15 | 19513a68140d |
hex | cc3c8697c9d |
14035020512413 has 8 divisors (see below), whose sum is σ = 14774224439520. Its totient is φ = 13295868449040.
The previous prime is 14035020512411. The next prime is 14035020512467. The reversal of 14035020512413 is 31421502053041.
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 14035020512413 - 21 = 14035020512411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14035020512411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12409843 + ... + 13493488.
It is an arithmetic number, because the mean of its divisors is an integer number (1846778054940).
Almost surely, 214035020512413 is an apocalyptic number.
It is an amenable number.
14035020512413 is a deficient number, since it is larger than the sum of its proper divisors (739203927107).
14035020512413 is a wasteful number, since it uses less digits than its factorization.
14035020512413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25931867.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 14035020512413 its reverse (31421502053041), we get a palindrome (45456522565454).
The spelling of 14035020512413 in words is "fourteen trillion, thirty-five billion, twenty million, five hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •