Base | Representation |
---|---|
bin | 1001000111110101110110… |
… | …1111010100100101010001 |
3 | 1022111220000100011000120012 |
4 | 2101331131233110211101 |
5 | 2303314044224303241 |
6 | 33155511020124305 |
7 | 2053444466340026 |
oct | 221753557244521 |
9 | 38456010130505 |
10 | 10030321322321 |
11 | 3217920995293 |
12 | 115bb3a396695 |
13 | 579b16c75671 |
14 | 2696820db54d |
15 | 125da1d8d6eb |
hex | 91f5dbd4951 |
10030321322321 has 8 divisors (see below), whose sum is σ = 10621728822600. Its totient is φ = 9439068110848.
The previous prime is 10030321322299. The next prime is 10030321322341. The reversal of 10030321322321 is 12322312303001.
It can be written as a sum of positive squares in 4 ways, for example, as 26315328400 + 10004005993921 = 162220^2 + 3162911^2 .
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 10030321322321 - 26 = 10030321322257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10030321322341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38438336 + ... + 38698401.
It is an arithmetic number, because the mean of its divisors is an integer number (1327716102825).
Almost surely, 210030321322321 is an apocalyptic number.
It is an amenable number.
10030321322321 is a deficient number, since it is larger than the sum of its proper divisors (591407500279).
10030321322321 is an equidigital number, since it uses as much as digits as its factorization.
10030321322321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77144403.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10030321322321 its reverse (12322312303001), we get a palindrome (22352633625322).
The spelling of 10030321322321 in words is "ten trillion, thirty billion, three hundred twenty-one million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •