Base | Representation |
---|---|
bin | 10000011100110100001… |
… | …010000100110000011010 |
3 | 11000001220002211221221111 |
4 | 100130310022010300122 |
5 | 122010131033030002 |
6 | 2223153333530534 |
7 | 144446432552512 |
oct | 20346412046032 |
9 | 4001802757844 |
10 | 1130451455002 |
11 | 3a6470414931 |
12 | 163109aa3a4a |
13 | 827a78593bc |
14 | 3c9dd86c842 |
15 | 1e6140543d7 |
hex | 10734284c1a |
1130451455002 has 8 divisors (see below), whose sum is σ = 1705478785236. Its totient is φ = 561958526592.
The previous prime is 1130451454991. The next prime is 1130451455011. The reversal of 1130451455002 is 2005541540311.
It can be written as a sum of positive squares in 2 ways, for example, as 1066967109481 + 63484345521 = 1032941^2 + 251961^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×11304514550023 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1633600023 + ... + 1633600714.
Almost surely, 21130451455002 is an apocalyptic number.
1130451455002 is a deficient number, since it is larger than the sum of its proper divisors (575027330234).
1130451455002 is a wasteful number, since it uses less digits than its factorization.
1130451455002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3267200912.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 1130451455002 its reverse (2005541540311), we get a palindrome (3135992995313).
The spelling of 1130451455002 in words is "one trillion, one hundred thirty billion, four hundred fifty-one million, four hundred fifty-five thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •