Base | Representation |
---|---|
bin | 10111011100101001000100… |
… | …111010110000010101110001 |
3 | 111112010111022112212012221102 |
4 | 113130221010322300111301 |
5 | 102004033030140430001 |
6 | 1003154111043534145 |
7 | 30502262012643056 |
oct | 2734510472602561 |
9 | 445114275765842 |
10 | 103123321030001 |
11 | 2a94939a335a68 |
12 | b695ba768a355 |
13 | 4570644bc66cc |
14 | 1b672a414302d |
15 | bdc71a822e6b |
hex | 5dca44eb0571 |
103123321030001 has 8 divisors (see below), whose sum is σ = 103756316695584. Its totient is φ = 102490329477600.
The previous prime is 103123321029899. The next prime is 103123321030007. The reversal of 103123321030001 is 100030123321301.
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 103123321030001 - 226 = 103123253921137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103123321030007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60550301 + ... + 62230101.
It is an arithmetic number, because the mean of its divisors is an integer number (12969539586948).
Almost surely, 2103123321030001 is an apocalyptic number.
It is an amenable number.
103123321030001 is a deficient number, since it is larger than the sum of its proper divisors (632995665583).
103123321030001 is a wasteful number, since it uses less digits than its factorization.
103123321030001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2056591.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 103123321030001 its reverse (100030123321301), we get a palindrome (203153444351302).
The spelling of 103123321030001 in words is "one hundred three trillion, one hundred twenty-three billion, three hundred twenty-one million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •