Base | Representation |
---|---|
bin | 110000000100100101… |
… | …1000110101111001110 |
3 | 100212110111022220210110 |
4 | 1200021023012233032 |
5 | 3142410134334410 |
6 | 115231420020450 |
7 | 10313133023631 |
oct | 1401113065716 |
9 | 325414286713 |
10 | 103233121230 |
11 | 3a865450a18 |
12 | 18010691726 |
13 | 99725a6b25 |
14 | 4dd45cbc18 |
15 | 2a42ecb720 |
hex | 18092c6bce |
103233121230 has 64 divisors (see below), whose sum is σ = 264100838400. Its totient is φ = 25749809280.
The previous prime is 103233121217. The next prime is 103233121237. The reversal of 103233121230 is 32121332301.
It is a junction number, because it is equal to n+sod(n) for n = 103233121197 and 103233121206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103233121237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1101241 + ... + 1191300.
It is an arithmetic number, because the mean of its divisors is an integer number (4126575600).
Almost surely, 2103233121230 is an apocalyptic number.
103233121230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103233121230 is an abundant number, since it is smaller than the sum of its proper divisors (160867717170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103233121230 is a wasteful number, since it uses less digits than its factorization.
103233121230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2292649.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 103233121230 its reverse (32121332301), we get a palindrome (135354453531).
The spelling of 103233121230 in words is "one hundred three billion, two hundred thirty-three million, one hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •