Base | Representation |
---|---|
bin | 1101000001101110000111… |
… | …1110000011000101101001 |
3 | 1212201021201021112001010201 |
4 | 3100123201332003011221 |
5 | 3334132414244312131 |
6 | 50243554240112201 |
7 | 3005550356041561 |
oct | 320334176030551 |
9 | 55637637461121 |
10 | 14323212104041 |
11 | 4622492911245 |
12 | 1733b26905661 |
13 | 7cb899a76459 |
14 | 377366311da1 |
15 | 19c8a6317761 |
hex | d06e1f83169 |
14323212104041 has 8 divisors (see below), whose sum is σ = 15488429610240. Its totient is φ = 13193847444288.
The previous prime is 14323212104021. The next prime is 14323212104081. The reversal of 14323212104041 is 14040121232341.
It is a happy number.
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 14323212104041 - 211 = 14323212101993 is a prime.
It is a super-2 number, since 2×143232121040412 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14323212104011) 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, 8963210781 + ... + 8963212378.
It is an arithmetic number, because the mean of its divisors is an integer number (1936053701280).
Almost surely, 214323212104041 is an apocalyptic number.
It is an amenable number.
14323212104041 is a deficient number, since it is larger than the sum of its proper divisors (1165217506199).
14323212104041 is a wasteful number, since it uses less digits than its factorization.
14323212104041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17926423223.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 14323212104041 its reverse (14040121232341), we get a palindrome (28363333336382).
The spelling of 14323212104041 in words is "fourteen trillion, three hundred twenty-three billion, two hundred twelve million, one hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •