Base | Representation |
---|---|
bin | 1001010011100101010010… |
… | …0010000101010110001101 |
3 | 1100020011122210012210011102 |
4 | 2110321110202011112031 |
5 | 2320120144230220023 |
6 | 33432310240032445 |
7 | 2104145151462425 |
oct | 224712442052615 |
9 | 40204583183142 |
10 | 10232030320013 |
11 | 329541a404777 |
12 | 1193052302725 |
13 | 592b51371678 |
14 | 275339167485 |
15 | 12b25a392628 |
hex | 94e5488558d |
10232030320013 has 8 divisors (see below), whose sum is σ = 10279632502656. Its totient is φ = 10184494025200.
The previous prime is 10232030319989. The next prime is 10232030320021. The reversal of 10232030320013 is 31002303023201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10232030320013 - 28 = 10232030319757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232030320033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16160633 + ... + 16781838.
It is an arithmetic number, because the mean of its divisors is an integer number (1284954062832).
Almost surely, 210232030320013 is an apocalyptic number.
It is an amenable number.
10232030320013 is a deficient number, since it is larger than the sum of its proper divisors (47602182643).
10232030320013 is a wasteful number, since it uses less digits than its factorization.
10232030320013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32943915.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10232030320013 its reverse (31002303023201), we get a palindrome (41234333343214).
The spelling of 10232030320013 in words is "ten trillion, two hundred thirty-two billion, thirty million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •