Base | Representation |
---|---|
bin | 10111011101110011010010… |
… | …011110001101010000001100 |
3 | 111112102002222212220200022210 |
4 | 113131303102132031100030 |
5 | 102011334223330303002 |
6 | 1003254450042510420 |
7 | 30511112452153653 |
oct | 2735632236152014 |
9 | 445362885820283 |
10 | 103203005322252 |
11 | 2a97a17000a150 |
12 | b6a9525805410 |
13 | 45780037c0bb4 |
14 | 1b6b0a2dba19a |
15 | bde83122d96c |
hex | 5ddcd278d40c |
103203005322252 has 96 divisors (see below), whose sum is σ = 290244955359744. Its totient is φ = 28154272537600.
The previous prime is 103203005322217. The next prime is 103203005322257. The reversal of 103203005322252 is 252223500302301.
It is not an unprimeable number, because it can be changed into a prime (103203005322257) 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, 999744999 + ... + 999848222.
It is an arithmetic number, because the mean of its divisors is an integer number (3023384951664).
Almost surely, 2103203005322252 is an apocalyptic number.
103203005322252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103203005322252 is an abundant number, since it is smaller than the sum of its proper divisors (187041950037492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103203005322252 is a wasteful number, since it uses less digits than its factorization.
103203005322252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1999593279 (or 1999593277 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 103203005322252 its reverse (252223500302301), we get a palindrome (355426505624553).
The spelling of 103203005322252 in words is "one hundred three trillion, two hundred three billion, five million, three hundred twenty-two thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •