Base | Representation |
---|---|
bin | 10100011011000001110… |
… | …001100011010111100001 |
3 | 11222011110002010120021022 |
4 | 110123001301203113201 |
5 | 140443141021043410 |
6 | 2552415013535225 |
7 | 203251546663226 |
oct | 24330161432741 |
9 | 4864402116238 |
10 | 1403410331105 |
11 | 4a12015aa552 |
12 | 1a7ba7344515 |
13 | a2458309183 |
14 | 4bcd550594d |
15 | 2678c758455 |
hex | 146c1c635e1 |
1403410331105 has 4 divisors (see below), whose sum is σ = 1684092397332. Its totient is φ = 1122728264880.
The previous prime is 1403410331083. The next prime is 1403410331129. The reversal of 1403410331105 is 5011330143041.
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 206609338849 + 1196800992256 = 454543^2 + 1093984^2 .
It is not a de Polignac number, because 1403410331105 - 214 = 1403410314721 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140341033106 + ... + 140341033115.
It is an arithmetic number, because the mean of its divisors is an integer number (421023099333).
Almost surely, 21403410331105 is an apocalyptic number.
It is an amenable number.
1403410331105 is a deficient number, since it is larger than the sum of its proper divisors (280682066227).
1403410331105 is an equidigital number, since it uses as much as digits as its factorization.
1403410331105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280682066226.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 1403410331105 its reverse (5011330143041), we get a palindrome (6414740474146).
The spelling of 1403410331105 in words is "one trillion, four hundred three billion, four hundred ten million, three hundred thirty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •