Base | Representation |
---|---|
bin | 1101010000101010001011… |
… | …0100100110100000000001 |
3 | 1220121211010212022120000001 |
4 | 3110022202310212200001 |
5 | 3402334013234411201 |
6 | 51001520240000001 |
7 | 3033234202111051 |
oct | 324124264464001 |
9 | 56554125276001 |
10 | 14579850700801 |
11 | 47113096964a1 |
12 | 177580a600001 |
13 | 819b492c18b9 |
14 | 385950685561 |
15 | 1a43c6d5d301 |
hex | d42a2d26801 |
14579850700801 has 4 divisors (see below), whose sum is σ = 14579861202004. Its totient is φ = 14579840199600.
The previous prime is 14579850700799. The next prime is 14579850700829. The reversal of 14579850700801 is 10800705897541.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 10096023275776 + 4483827425025 = 3177424^2 + 2117505^2 .
It is a cyclic number.
It is not a de Polignac number, because 14579850700801 - 21 = 14579850700799 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14579850700861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2780730 + ... + 6073891.
It is an arithmetic number, because the mean of its divisors is an integer number (3644965300501).
Almost surely, 214579850700801 is an apocalyptic number.
It is an amenable number.
14579850700801 is a deficient number, since it is larger than the sum of its proper divisors (10501203).
14579850700801 is an equidigital number, since it uses as much as digits as its factorization.
14579850700801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10501202.
The product of its (nonzero) digits is 2822400, while the sum is 55.
The spelling of 14579850700801 in words is "fourteen trillion, five hundred seventy-nine billion, eight hundred fifty million, seven hundred thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •