Base | Representation |
---|---|
bin | 10111011011010100111110… |
… | …001001011000011101011101 |
3 | 111111210212012211120120211121 |
4 | 113123110332021120131131 |
5 | 102001043102324014441 |
6 | 1003044413543450541 |
7 | 30462614054204266 |
oct | 2733247611303535 |
9 | 444725184516747 |
10 | 103033013110621 |
11 | 2a914067921550 |
12 | b6805a3756a51 |
13 | 4564c82362b19 |
14 | 1b62b783ad96d |
15 | bda1d2420dd1 |
hex | 5db53e25875d |
103033013110621 has 32 divisors (see below), whose sum is σ = 113756034631680. Its totient is φ = 92543307729600.
The previous prime is 103033013110619. The next prime is 103033013110681. The reversal of 103033013110621 is 126011310330301.
It is a cyclic number.
It is not a de Polignac number, because 103033013110621 - 21 = 103033013110619 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103033013110681) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 735507016 + ... + 735647086.
It is an arithmetic number, because the mean of its divisors is an integer number (3554876082240).
Almost surely, 2103033013110621 is an apocalyptic number.
103033013110621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103033013110621 is a deficient number, since it is larger than the sum of its proper divisors (10723021521059).
103033013110621 is a wasteful number, since it uses less digits than its factorization.
103033013110621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142665.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 103033013110621 its reverse (126011310330301), we get a palindrome (229044323440922).
The spelling of 103033013110621 in words is "one hundred three trillion, thirty-three billion, thirteen million, one hundred ten thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •