Base | Representation |
---|---|
bin | 1100101111100100001111… |
… | …0100000001111000011111 |
3 | 1211121110200001102222102021 |
4 | 3023321003310001320133 |
5 | 3314030141141012343 |
6 | 45444413444041011 |
7 | 2644166411501314 |
oct | 313710364017037 |
9 | 54543601388367 |
10 | 14011321032223 |
11 | 45121934a2769 |
12 | 16a35a3093167 |
13 | 7a8353531598 |
14 | 366219c28d0b |
15 | 1946eec530ed |
hex | cbe43d01e1f |
14011321032223 has 8 divisors (see below), whose sum is σ = 14264215138368. Its totient is φ = 13760074445184.
The previous prime is 14011321032217. The next prime is 14011321032253. The reversal of 14011321032223 is 32223012311041.
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 14011321032223 - 29 = 14011321031711 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14011321032253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 411862615 + ... + 411896632.
It is an arithmetic number, because the mean of its divisors is an integer number (1783026892296).
Almost surely, 214011321032223 is an apocalyptic number.
14011321032223 is a deficient number, since it is larger than the sum of its proper divisors (252894106145).
14011321032223 is an equidigital number, since it uses as much as digits as its factorization.
14011321032223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 823759553.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 14011321032223 its reverse (32223012311041), we get a palindrome (46234333343264).
The spelling of 14011321032223 in words is "fourteen trillion, eleven billion, three hundred twenty-one million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •