Base | Representation |
---|---|
bin | 10101110111111001000… |
… | …000110100111111010100 |
3 | 12022200211002222010201021 |
4 | 111313321000310333110 |
5 | 144111343030031012 |
6 | 3110305134410524 |
7 | 213411514332262 |
oct | 25677100647724 |
9 | 5280732863637 |
10 | 1503121330132 |
11 | 52a519893974 |
12 | 203394360a44 |
13 | ab988c9c306 |
14 | 52a74017432 |
15 | 29176408007 |
hex | 15df9034fd4 |
1503121330132 has 6 divisors (see below), whose sum is σ = 2630462327738. Its totient is φ = 751560665064.
The previous prime is 1503121330111. The next prime is 1503121330147. The reversal of 1503121330132 is 2310331213051.
It can be written as a sum of positive squares in only one way, i.e., 1283494131396 + 219627198736 = 1132914^2 + 468644^2 .
It is a super-2 number, since 2×15031213301322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1503121330097 and 1503121330106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 187890166263 + ... + 187890166270.
Almost surely, 21503121330132 is an apocalyptic number.
It is an amenable number.
1503121330132 is a deficient number, since it is larger than the sum of its proper divisors (1127340997606).
1503121330132 is a wasteful number, since it uses less digits than its factorization.
1503121330132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375780332537 (or 375780332535 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 1503121330132 its reverse (2310331213051), we get a palindrome (3813452543183).
The spelling of 1503121330132 in words is "one trillion, five hundred three billion, one hundred twenty-one million, three hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •