Base | Representation |
---|---|
bin | 1100110000111100100001… |
… | …1010010110000011111100 |
3 | 1211200201211201011221201212 |
4 | 3030033020122112003330 |
5 | 3314422210222132330 |
6 | 45503333250023552 |
7 | 2645665614626162 |
oct | 314171032260374 |
9 | 54621751157655 |
10 | 14035020505340 |
11 | 452124520168a |
12 | 16a80b7b77bb8 |
13 | 7aa65c4a7063 |
14 | 367427595232 |
15 | 19513a67e295 |
hex | cc3c86960fc |
14035020505340 has 12 divisors (see below), whose sum is σ = 29473543061256. Its totient is φ = 5614008202128.
The previous prime is 14035020505333. The next prime is 14035020505361. The reversal of 14035020505340 is 4350502053041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 14035020505297 and 14035020505306.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350875512614 + ... + 350875512653.
It is an arithmetic number, because the mean of its divisors is an integer number (2456128588438).
Almost surely, 214035020505340 is an apocalyptic number.
14035020505340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14035020505340 is an abundant number, since it is smaller than the sum of its proper divisors (15438522555916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14035020505340 is a wasteful number, since it uses less digits than its factorization.
14035020505340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701751025276 (or 701751025274 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 14035020505340 its reverse (4350502053041), we get a palindrome (18385522558381).
The spelling of 14035020505340 in words is "fourteen trillion, thirty-five billion, twenty million, five hundred five thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •