Base | Representation |
---|---|
bin | 10100011000111011001… |
… | …100101001110001000001 |
3 | 11221221121201122102101222 |
4 | 110120323030221301001 |
5 | 140424030020323131 |
6 | 2551403001004425 |
7 | 203141602556363 |
oct | 24307314516101 |
9 | 4857551572358 |
10 | 1401152511041 |
11 | 4a0253078958 |
12 | 1a7677183715 |
13 | a2188611b7a |
14 | 4bb5d6d6d33 |
15 | 266a941987b |
hex | 1463b329c41 |
1401152511041 has 4 divisors (see below), whose sum is σ = 1449468114900. Its totient is φ = 1352836907184.
The previous prime is 1401152511001. The next prime is 1401152511079.
1401152511041 is nontrivially palindromic in base 10.
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 659512906816 + 741639604225 = 812104^2 + 861185^2 .
It is a cyclic number.
It is not a de Polignac number, because 1401152511041 - 218 = 1401152248897 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1401152511041.
It is not an unprimeable number, because it can be changed into a prime (1401152511001) 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, 24157801886 + ... + 24157801943.
It is an arithmetic number, because the mean of its divisors is an integer number (362367028725).
Almost surely, 21401152511041 is an apocalyptic number.
It is an amenable number.
1401152511041 is a deficient number, since it is larger than the sum of its proper divisors (48315603859).
1401152511041 is an equidigital number, since it uses as much as digits as its factorization.
1401152511041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48315603858.
The product of its (nonzero) digits is 800, while the sum is 26.
The spelling of 1401152511041 in words is "one trillion, four hundred one billion, one hundred fifty-two million, five hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •