Base | Representation |
---|---|
bin | 10011010000001000111… |
… | …100011111101010011110 |
3 | 11200110220010220200020122 |
4 | 103100020330133222132 |
5 | 133134001000100410 |
6 | 2451440001314542 |
7 | 164404113323363 |
oct | 23201074375236 |
9 | 4613803820218 |
10 | 1323000003230 |
11 | 470099014024 |
12 | 1944a6035a52 |
13 | 979b2187bc9 |
14 | 4806807846a |
15 | 24633235e55 |
hex | 13408f1fa9e |
1323000003230 has 8 divisors (see below), whose sum is σ = 2381400005832. Its totient is φ = 529200001288.
The previous prime is 1323000003211. The next prime is 1323000003239. The reversal of 1323000003230 is 323000003231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1323000003199 and 1323000003208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323000003239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66150000152 + ... + 66150000171.
It is an arithmetic number, because the mean of its divisors is an integer number (297675000729).
Almost surely, 21323000003230 is an apocalyptic number.
1323000003230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1323000003230 is a deficient number, since it is larger than the sum of its proper divisors (1058400002602).
1323000003230 is a wasteful number, since it uses less digits than its factorization.
1323000003230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132300000330.
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 1323000003230 its reverse (323000003231), we get a palindrome (1646000006461).
Subtracting from 1323000003230 its reverse (323000003231), we obtain a palindrome (999999999999).
The spelling of 1323000003230 in words is "one trillion, three hundred twenty-three billion, three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •