Base | Representation |
---|---|
bin | 101111111110101011… |
… | …1011101001100100001 |
3 | 100211221200120221221101 |
4 | 1133331113131030201 |
5 | 3142003432013403 |
6 | 115200022154401 |
7 | 10305206216221 |
oct | 1377527351441 |
9 | 324850527841 |
10 | 103035032353 |
11 | 3a773653900 |
12 | 17b76282a01 |
13 | 994053b686 |
14 | 4db6186081 |
15 | 2a308ed71d |
hex | 17fd5dd321 |
103035032353 has 12 divisors (see below), whose sum is σ = 113656457124. Its totient is φ = 93334841600.
The previous prime is 103035032339. The next prime is 103035032431. The reversal of 103035032353 is 353230530301.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 76913038224 + 26121994129 = 277332^2 + 161623^2 .
It is not a de Polignac number, because 103035032353 - 213 = 103035024161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103035032333) by changing a digit.
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 in 11 ways as a sum of consecutive naturals, for example, 1481176 + ... + 1549177.
It is an arithmetic number, because the mean of its divisors is an integer number (9471371427).
Almost surely, 2103035032353 is an apocalyptic number.
It is an amenable number.
103035032353 is a deficient number, since it is larger than the sum of its proper divisors (10621424771).
103035032353 is a wasteful number, since it uses less digits than its factorization.
103035032353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3030656 (or 3030645 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 28.
Adding to 103035032353 its reverse (353230530301), we get a palindrome (456265562654).
The spelling of 103035032353 in words is "one hundred three billion, thirty-five million, thirty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •