Base | Representation |
---|---|
bin | 1100110000111100101001… |
… | …1010001111100001101001 |
3 | 1211200201221001021100001002 |
4 | 3030033022122033201221 |
5 | 3314422242313024001 |
6 | 45503340444404345 |
7 | 2645666502616361 |
oct | 314171232174151 |
9 | 54621831240032 |
10 | 14035054033001 |
11 | 45212621214a1 |
12 | 16a81072466b5 |
13 | 7aa666415901 |
14 | 36742bc019a1 |
15 | 19513d5a346b |
hex | cc3ca68f869 |
14035054033001 has 8 divisors (see below), whose sum is σ = 14277582440064. Its totient is φ = 13793497684560.
The previous prime is 14035054032971. The next prime is 14035054033003. The reversal of 14035054033001 is 10033045053041.
14035054033001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14035054033001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14035054033003) 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, 242985530 + ... + 243043283.
It is an arithmetic number, because the mean of its divisors is an integer number (1784697805008).
Almost surely, 214035054033001 is an apocalyptic number.
It is an amenable number.
14035054033001 is a deficient number, since it is larger than the sum of its proper divisors (242528407063).
14035054033001 is an equidigital number, since it uses as much as digits as its factorization.
14035054033001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486029311.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 14035054033001 its reverse (10033045053041), we get a palindrome (24068099086042).
The spelling of 14035054033001 in words is "fourteen trillion, thirty-five billion, fifty-four million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •