Base | Representation |
---|---|
bin | 1101110110000000101101… |
… | …11000100100111111110011 |
3 | 10222210022222211022222002012 |
4 | 12323000112320210333303 |
5 | 12442234443200440103 |
6 | 144425212253513135 |
7 | 6261304461324056 |
oct | 673002670447763 |
9 | 128708884288065 |
10 | 30443112124403 |
11 | 9777940164630 |
12 | 34b80b47a27ab |
13 | 13caa08811674 |
14 | 77365118ca9d |
15 | 37bd664ea2d8 |
hex | 1bb016e24ff3 |
30443112124403 has 8 divisors (see below), whose sum is σ = 33665608427376. Its totient is φ = 27296439264000.
The previous prime is 30443112124387. The next prime is 30443112124457. The reversal of 30443112124403 is 30442121134403.
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 30443112124403 - 24 = 30443112124387 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 30443112124403.
It is not an unprimeable number, because it can be changed into a prime (30443112124493) 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, 18955859798 + ... + 18955861403.
It is an arithmetic number, because the mean of its divisors is an integer number (4208201053422).
Almost surely, 230443112124403 is an apocalyptic number.
30443112124403 is a deficient number, since it is larger than the sum of its proper divisors (3222496302973).
30443112124403 is a wasteful number, since it uses less digits than its factorization.
30443112124403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37911721285.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 30443112124403 its reverse (30442121134403), we get a palindrome (60885233258806).
The spelling of 30443112124403 in words is "thirty trillion, four hundred forty-three billion, one hundred twelve million, one hundred twenty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •