Base | Representation |
---|---|
bin | 10111011100110001001011… |
… | …011110111110011111000011 |
3 | 111112011022202212121201220110 |
4 | 113130301023132332133003 |
5 | 102004203334401414021 |
6 | 1003202110233042403 |
7 | 30503020424342526 |
oct | 2734611336763703 |
9 | 445138685551813 |
10 | 103132021123011 |
11 | 2a952054306681 |
12 | b697815256403 |
13 | 45714004ac33a |
14 | 1b6788b7aabbd |
15 | bdca7950d476 |
hex | 5dcc4b7be7c3 |
103132021123011 has 16 divisors (see below), whose sum is σ = 137959747488000. Its totient is φ = 68529643230048.
The previous prime is 103132021122979. The next prime is 103132021123147. The reversal of 103132021123011 is 110321120231301.
It is not a de Polignac number, because 103132021123011 - 25 = 103132021122979 is a prime.
It is a super-2 number, since 2×1031320211230112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103132021123211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16779631 + ... + 22086648.
It is an arithmetic number, because the mean of its divisors is an integer number (8622484218000).
Almost surely, 2103132021123011 is an apocalyptic number.
103132021123011 is a deficient number, since it is larger than the sum of its proper divisors (34827726364989).
103132021123011 is a wasteful number, since it uses less digits than its factorization.
103132021123011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38869178.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 103132021123011 its reverse (110321120231301), we get a palindrome (213453141354312).
The spelling of 103132021123011 in words is "one hundred three trillion, one hundred thirty-two billion, twenty-one million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •