Base | Representation |
---|---|
bin | 1100101110111011101000… |
… | …0111101101110001011101 |
3 | 1211120102112102010002101112 |
4 | 3023232322013231301131 |
5 | 3313340330234033313 |
6 | 45435412110351405 |
7 | 2643332324664443 |
oct | 313567207556135 |
9 | 54512472102345 |
10 | 14000421002333 |
11 | 45085aa7359a7 |
12 | 16a14607bb565 |
13 | 7a7307239c5c |
14 | 3658a433cb93 |
15 | 1942b2d5e8a8 |
hex | cbbba1edc5d |
14000421002333 has 8 divisors (see below), whose sum is σ = 14126774262720. Its totient is φ = 13874510311200.
The previous prime is 14000421002297. The next prime is 14000421002401. The reversal of 14000421002333 is 33320012400041.
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 14000421002333 - 228 = 14000152566877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14000421002299 and 14000421002308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14000421062333) 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, 110578760 + ... + 110705297.
It is an arithmetic number, because the mean of its divisors is an integer number (1765846782840).
Almost surely, 214000421002333 is an apocalyptic number.
It is an amenable number.
14000421002333 is a deficient number, since it is larger than the sum of its proper divisors (126353260387).
14000421002333 is a wasteful number, since it uses less digits than its factorization.
14000421002333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221284627.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 14000421002333 its reverse (33320012400041), we get a palindrome (47320433402374).
The spelling of 14000421002333 in words is "fourteen trillion, four hundred twenty-one million, two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •