Base | Representation |
---|---|
bin | 10001011110101001001… |
… | …010101111010010110001 |
3 | 11020211100002121022201212 |
4 | 101132221022233102301 |
5 | 124134410303241431 |
6 | 2315443211005505 |
7 | 152531135612552 |
oct | 21365112572261 |
9 | 4224302538655 |
10 | 1201134040241 |
11 | 423441941333 |
12 | 174955439895 |
13 | 89360526635 |
14 | 421c6da8329 |
15 | 2139e54772b |
hex | 117a92af4b1 |
1201134040241 has 8 divisors (see below), whose sum is σ = 1234311488424. Its totient is φ = 1168141425280.
The previous prime is 1201134040217. The next prime is 1201134040283. The reversal of 1201134040241 is 1420404311021.
It can be written as a sum of positive squares in 4 ways, for example, as 65781990400 + 1135352049841 = 256480^2 + 1065529^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1201134040241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1201134040201) 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, 46195130 + ... + 46221123.
It is an arithmetic number, because the mean of its divisors is an integer number (154288936053).
Almost surely, 21201134040241 is an apocalyptic number.
It is an amenable number.
1201134040241 is a deficient number, since it is larger than the sum of its proper divisors (33177448183).
1201134040241 is an equidigital number, since it uses as much as digits as its factorization.
1201134040241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92416611.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1201134040241 its reverse (1420404311021), we get a palindrome (2621538351262).
The spelling of 1201134040241 in words is "one trillion, two hundred one billion, one hundred thirty-four million, forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •