Base | Representation |
---|---|
bin | 101000010100111… |
… | …0000010111100100 |
3 | 10111022010210012210 |
4 | 1100221300113210 |
5 | 10232344421200 |
6 | 342134043420 |
7 | 45350233614 |
oct | 12051602744 |
9 | 3438123183 |
10 | 1353123300 |
11 | 634891621 |
12 | 3191a9570 |
13 | 187447b99 |
14 | cb9cca44 |
15 | 7dbd5650 |
hex | 50a705e4 |
1353123300 has 144 divisors (see below), whose sum is σ = 4054393280. Its totient is φ = 348157440.
The previous prime is 1353123293. The next prime is 1353123311. The reversal of 1353123300 is 33213531.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1542462 + ... + 1543338.
Almost surely, 21353123300 is an apocalyptic number.
1353123300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1353123300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2027196640).
1353123300 is an abundant number, since it is smaller than the sum of its proper divisors (2701269980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1353123300 is a wasteful number, since it uses less digits than its factorization.
1353123300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070 (or 1063 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 21.
The square root of 1353123300 is about 36784.8243165575. The cubic root of 1353123300 is about 1106.0611142923.
Adding to 1353123300 its reverse (33213531), we get a palindrome (1386336831).
The spelling of 1353123300 in words is "one billion, three hundred fifty-three million, one hundred twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •