Base | Representation |
---|---|
bin | 1100110000111001000110… |
… | …0111011110010010101001 |
3 | 1211200122110122100101221110 |
4 | 3030032101213132102221 |
5 | 3314413314401400131 |
6 | 45503102130100533 |
7 | 2645634052643616 |
oct | 314162147362251 |
9 | 54618418311843 |
10 | 14034101200041 |
11 | 4520913293a3a |
12 | 16a7aa011a749 |
13 | 7aa543bb1520 |
14 | 36737b45150d |
15 | 1950d4adc646 |
hex | cc3919de4a9 |
14034101200041 has 32 divisors (see below), whose sum is σ = 20395320809472. Its totient is φ = 8531898384960.
The previous prime is 14034101200039. The next prime is 14034101200057. The reversal of 14034101200041 is 14000210143041.
14034101200041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14034101200041 - 21 = 14034101200039 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14034101199990 and 14034101200017.
It is not an unprimeable number, because it can be changed into a prime (14034101200001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73744176 + ... + 73934238.
It is an arithmetic number, because the mean of its divisors is an integer number (637353775296).
Almost surely, 214034101200041 is an apocalyptic number.
It is an amenable number.
14034101200041 is a deficient number, since it is larger than the sum of its proper divisors (6361219609431).
14034101200041 is a wasteful number, since it uses less digits than its factorization.
14034101200041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212973.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 14034101200041 its reverse (14000210143041), we get a palindrome (28034311343082).
The spelling of 14034101200041 in words is "fourteen trillion, thirty-four billion, one hundred one million, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •