Base | Representation |
---|---|
bin | 10100011010001000001… |
… | …100100011111111010101 |
3 | 11222001221202102210000012 |
4 | 110122020030203333111 |
5 | 140434201222124023 |
6 | 2552135105130005 |
7 | 203215610066243 |
oct | 24321014437725 |
9 | 4861852383005 |
10 | 1402444333013 |
11 | 4a085629a919 |
12 | 1a7977929905 |
13 | a2333145679 |
14 | 4bc430c9793 |
15 | 26732a41978 |
hex | 14688323fd5 |
1402444333013 has 4 divisors (see below), whose sum is σ = 1412681153100. Its totient is φ = 1392207512928.
The previous prime is 1402444333009. The next prime is 1402444333051. The reversal of 1402444333013 is 3103334442041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1219330518289 + 183113814724 = 1104233^2 + 427918^2 .
It is a cyclic number.
It is not a de Polignac number, because 1402444333013 - 22 = 1402444333009 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 (1402444333613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5118409838 + ... + 5118410111.
It is an arithmetic number, because the mean of its divisors is an integer number (353170288275).
Almost surely, 21402444333013 is an apocalyptic number.
It is an amenable number.
1402444333013 is a deficient number, since it is larger than the sum of its proper divisors (10236820087).
1402444333013 is a wasteful number, since it uses less digits than its factorization.
1402444333013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10236820086.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 1402444333013 its reverse (3103334442041), we get a palindrome (4505778775054).
The spelling of 1402444333013 in words is "one trillion, four hundred two billion, four hundred forty-four million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •