Base | Representation |
---|---|
bin | 110000000001100111… |
… | …0010111000101000110 |
3 | 100212012112112001022110 |
4 | 1200003032113011012 |
5 | 3142204111430202 |
6 | 115213452441450 |
7 | 10310511452610 |
oct | 1400316270506 |
9 | 325175461273 |
10 | 103133311302 |
11 | 3a81407a27a |
12 | 17ba3179286 |
13 | 99579cb9b8 |
14 | 4dc5249db0 |
15 | 2a3936326c |
hex | 1803397146 |
103133311302 has 64 divisors (see below), whose sum is σ = 240306393600. Its totient is φ = 28895602944.
The previous prime is 103133311301. The next prime is 103133311313. The reversal of 103133311302 is 203113331301.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103133311301) 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, 4661338 + ... + 4683410.
It is an arithmetic number, because the mean of its divisors is an integer number (3754787400).
Almost surely, 2103133311302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103133311302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120153196800).
103133311302 is an abundant number, since it is smaller than the sum of its proper divisors (137173082298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103133311302 is a wasteful number, since it uses less digits than its factorization.
103133311302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24237.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103133311302 its reverse (203113331301), we get a palindrome (306246642603).
The spelling of 103133311302 in words is "one hundred three billion, one hundred thirty-three million, three hundred eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •