Base | Representation |
---|---|
bin | 10111011100100111000010… |
… | …011100011000100101011111 |
3 | 111112010021122222212111212112 |
4 | 113130213002130120211133 |
5 | 102004014034244432203 |
6 | 1003153105530024235 |
7 | 30502153532520542 |
oct | 2734470234304537 |
9 | 445107588774775 |
10 | 103121132030303 |
11 | 2a94847673a102 |
12 | b69569657807b |
13 | 457038654700a |
14 | 1b6713752a859 |
15 | bdc63d57a6d8 |
hex | 5dc9c271895f |
103121132030303 has 8 divisors (see below), whose sum is σ = 109856940368688. Its totient is φ = 96459752513664.
The previous prime is 103121132030299. The next prime is 103121132030309. The reversal of 103121132030303 is 303030231121301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103121132030303 - 22 = 103121132030299 is a prime.
It is a super-2 number, since 2×1031211320303032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103121132030309) 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, 18607202576 + ... + 18607208117.
It is an arithmetic number, because the mean of its divisors is an integer number (13732117546086).
Almost surely, 2103121132030303 is an apocalyptic number.
103121132030303 is a deficient number, since it is larger than the sum of its proper divisors (6735808338385).
103121132030303 is a wasteful number, since it uses less digits than its factorization.
103121132030303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37214410873.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 103121132030303 its reverse (303030231121301), we get a palindrome (406151363151604).
The spelling of 103121132030303 in words is "one hundred three trillion, one hundred twenty-one billion, one hundred thirty-two million, thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •