Base | Representation |
---|---|
bin | 10111011010110110010101… |
… | …000101101110001001110011 |
3 | 111111200201021220101112110001 |
4 | 113122312111011232021303 |
5 | 102000023212134432243 |
6 | 1003021333115250431 |
7 | 30460340536505344 |
oct | 2732662505561163 |
9 | 444621256345401 |
10 | 103000112030323 |
11 | 2a9011140409a2 |
12 | b676141149a17 |
13 | 4561b3ac3c381 |
14 | 1b6133694c0cb |
15 | bd9408c92a4d |
hex | 5dad9516e273 |
103000112030323 has 8 divisors (see below), whose sum is σ = 103951887169536. Its totient is φ = 102052633845000.
The previous prime is 103000112030311. The next prime is 103000112030341. The reversal of 103000112030323 is 323030211000301.
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 103000112030323 - 29 = 103000112029811 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103000112030323.
It is not an unprimeable number, because it can be changed into a prime (103000112030303) 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, 1074190311 + ... + 1074286192.
It is an arithmetic number, because the mean of its divisors is an integer number (12993985896192).
Almost surely, 2103000112030323 is an apocalyptic number.
103000112030323 is a deficient number, since it is larger than the sum of its proper divisors (951775139213).
103000112030323 is a wasteful number, since it uses less digits than its factorization.
103000112030323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2148476945.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 103000112030323 its reverse (323030211000301), we get a palindrome (426030323030624).
The spelling of 103000112030323 in words is "one hundred three trillion, one hundred twelve million, thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •