Base | Representation |
---|---|
bin | 1101110100111010101101… |
… | …10101110101011011001111 |
3 | 10222122201222200202122212202 |
4 | 12322131112311311123033 |
5 | 12441131011243111143 |
6 | 144400035143552115 |
7 | 6255504250306154 |
oct | 672352665653317 |
9 | 128581880678782 |
10 | 30405530441423 |
11 | 9762a052999a5 |
12 | 34b096675b63b |
13 | 13c72c978c127 |
14 | 7718c7c4c22b |
15 | 37adb6ea6ab8 |
hex | 1ba756d756cf |
30405530441423 has 4 divisors (see below), whose sum is σ = 30405545741448. Its totient is φ = 30405515141400.
The previous prime is 30405530441413. The next prime is 30405530441441. The reversal of 30405530441423 is 32414403550403.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30405530441423 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 (30405530441413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4128836 + ... + 8823737.
It is an arithmetic number, because the mean of its divisors is an integer number (7601386435362).
Almost surely, 230405530441423 is an apocalyptic number.
30405530441423 is a deficient number, since it is larger than the sum of its proper divisors (15300025).
30405530441423 is a wasteful number, since it uses less digits than its factorization.
30405530441423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15300024.
The product of its (nonzero) digits is 345600, while the sum is 38.
Adding to 30405530441423 its reverse (32414403550403), we get a palindrome (62819933991826).
The spelling of 30405530441423 in words is "thirty trillion, four hundred five billion, five hundred thirty million, four hundred forty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •