Base | Representation |
---|---|
bin | 10000100110101001101… |
… | …011100100010110000010 |
3 | 11001002011011110022122200 |
4 | 100212221223210112002 |
5 | 122143243323312002 |
6 | 2232101342414030 |
7 | 145302240234222 |
oct | 20465153442602 |
9 | 4032134408580 |
10 | 1141013104002 |
11 | 3aa9a0173072 |
12 | 165176b91316 |
13 | 8379ba05355 |
14 | 3d322434082 |
15 | 1ea313a6b1c |
hex | 109a9ae4582 |
1141013104002 has 12 divisors (see below), whose sum is σ = 2472195058710. Its totient is φ = 380337701328.
The previous prime is 1141013103929. The next prime is 1141013104069. The reversal of 1141013104002 is 2004013101411.
It can be written as a sum of positive squares in only one way, i.e., 673678166841 + 467334937161 = 820779^2 + 683619^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 63389616889 = 1141013104002 / (1 + 1 + 4 + 1 + 0 + 1 + 3 + 1 + 0 + 4 + 0 + 0 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 31694808427 + ... + 31694808462.
Almost surely, 21141013104002 is an apocalyptic number.
1141013104002 is an abundant number, since it is smaller than the sum of its proper divisors (1331181954708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1141013104002 is a wasteful number, since it uses less digits than its factorization.
1141013104002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63389616897 (or 63389616894 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1141013104002 its reverse (2004013101411), we get a palindrome (3145026205413).
The spelling of 1141013104002 in words is "one trillion, one hundred forty-one billion, thirteen million, one hundred four thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •