Base | Representation |
---|---|
bin | 10111011100110010010010… |
… | …111100011100101101000111 |
3 | 111112011102212102120120220021 |
4 | 113130302102330130231013 |
5 | 102004213313312000203 |
6 | 1003202425221520011 |
7 | 30503062223033140 |
oct | 2734622274345507 |
9 | 445142772516807 |
10 | 103133220031303 |
11 | 2a95260a037180 |
12 | b697aaa873007 |
13 | 45715619b0927 |
14 | 1b67962ad4ac7 |
15 | bdcae98d05bd |
hex | 5dcc92f1cb47 |
103133220031303 has 16 divisors (see below), whose sum is σ = 128728292373504. Its totient is φ = 80271913419360.
The previous prime is 103133220031301. The next prime is 103133220031333. The reversal of 103133220031303 is 303130022331301.
It is a cyclic number.
It is not a de Polignac number, because 103133220031303 - 21 = 103133220031301 is a prime.
It is a super-2 number, since 2×1031332200313032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103133220031301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 763554175 + ... + 763689232.
It is an arithmetic number, because the mean of its divisors is an integer number (8045518273344).
Almost surely, 2103133220031303 is an apocalyptic number.
103133220031303 is a deficient number, since it is larger than the sum of its proper divisors (25595072342201).
103133220031303 is a wasteful number, since it uses less digits than its factorization.
103133220031303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1527244302.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 103133220031303 its reverse (303130022331301), we get a palindrome (406263242362604).
The spelling of 103133220031303 in words is "one hundred three trillion, one hundred thirty-three billion, two hundred twenty million, thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •