Base | Representation |
---|---|
bin | 1100110001110100110010… |
… | …1101100000000101000111 |
3 | 1211202011211100222212122201 |
4 | 3030131030231200011013 |
5 | 3320144124001142021 |
6 | 45514312140135331 |
7 | 2650042124120365 |
oct | 314351455400507 |
9 | 54664740885581 |
10 | 14050125021511 |
11 | 452769631a1a7 |
12 | 16ab012537547 |
13 | 7abbc88883a7 |
14 | 36805b624635 |
15 | 19572173b591 |
hex | cc74cb60147 |
14050125021511 has 8 divisors (see below), whose sum is σ = 14460410482560. Its totient is φ = 13645577818872.
The previous prime is 14050125021481. The next prime is 14050125021521. The reversal of 14050125021511 is 11512052105041.
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 14050125021511 - 229 = 14049588150599 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14050125021511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14050125021521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1434559635 + ... + 1434569428.
It is an arithmetic number, because the mean of its divisors is an integer number (1807551310320).
Almost surely, 214050125021511 is an apocalyptic number.
14050125021511 is a deficient number, since it is larger than the sum of its proper divisors (410285461049).
14050125021511 is an equidigital number, since it uses as much as digits as its factorization.
14050125021511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2869129205.
The product of its (nonzero) digits is 2000, while the sum is 28.
Adding to 14050125021511 its reverse (11512052105041), we get a palindrome (25562177126552).
The spelling of 14050125021511 in words is "fourteen trillion, fifty billion, one hundred twenty-five million, twenty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •