Base | Representation |
---|---|
bin | 10100011100110101001… |
… | …011001100111111100001 |
3 | 11222100110000020211120111 |
4 | 110130311023030333201 |
5 | 141011122141410131 |
6 | 2553335055211321 |
7 | 203350536413143 |
oct | 24346513147741 |
9 | 4870400224514 |
10 | 1405346435041 |
11 | 4a200547504a |
12 | 1a8447816b41 |
13 | a26a64710c3 |
14 | 4c03a6cac93 |
15 | 268526e8ab1 |
hex | 147352ccfe1 |
1405346435041 has 8 divisors (see below), whose sum is σ = 1408636336104. Its totient is φ = 1402057472640.
The previous prime is 1405346435033. The next prime is 1405346435057.
1405346435041 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 2059798225 + 1403286636816 = 45385^2 + 1184604^2 .
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 1405346435041 - 23 = 1405346435033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1405346434985 and 1405346435003.
It is not an unprimeable number, because it can be changed into a prime (1405346435011) 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, 2809311 + ... + 3271531.
It is an arithmetic number, because the mean of its divisors is an integer number (176079542013).
Almost surely, 21405346435041 is an apocalyptic number.
It is an amenable number.
1405346435041 is a deficient number, since it is larger than the sum of its proper divisors (3289901063).
1405346435041 is an equidigital number, since it uses as much as digits as its factorization.
1405346435041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 469331.
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 1405346435041 in words is "one trillion, four hundred five billion, three hundred forty-six million, four hundred thirty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •