Base | Representation |
---|---|
bin | 10100011001110001011… |
… | …111000100111100011101 |
3 | 11222000222012110211112202 |
4 | 110121301133010330131 |
5 | 140432411201414441 |
6 | 2552033214341245 |
7 | 203203302334631 |
oct | 24316137047435 |
9 | 4860865424482 |
10 | 1402063310621 |
11 | 4a0680207086 |
12 | 1a78901ba825 |
13 | a22a221a02c |
14 | 4bc08664dc1 |
15 | 2670e37b19b |
hex | 146717c4f1d |
1402063310621 has 4 divisors (see below), whose sum is σ = 1414470950652. Its totient is φ = 1389655670592.
The previous prime is 1402063310611. The next prime is 1402063310639. The reversal of 1402063310621 is 1260133602041.
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 618643598521 + 783419712100 = 786539^2 + 885110^2 .
It is a cyclic number.
It is not a de Polignac number, because 1402063310621 - 226 = 1401996201757 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 (1402063310611) 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, 6203819846 + ... + 6203820071.
It is an arithmetic number, because the mean of its divisors is an integer number (353617737663).
Almost surely, 21402063310621 is an apocalyptic number.
It is an amenable number.
1402063310621 is a deficient number, since it is larger than the sum of its proper divisors (12407640031).
1402063310621 is a wasteful number, since it uses less digits than its factorization.
1402063310621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12407640030.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 1402063310621 its reverse (1260133602041), we get a palindrome (2662196912662).
The spelling of 1402063310621 in words is "one trillion, four hundred two billion, sixty-three million, three hundred ten thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •