Base | Representation |
---|---|
bin | 1101110000001100110010… |
… | …00110001000000110101001 |
3 | 10222002020120212022012210101 |
4 | 12320012121012020012221 |
5 | 12431002022403014431 |
6 | 144153350314345401 |
7 | 6241005320030650 |
oct | 670063106100651 |
9 | 128066525265711 |
10 | 30243433251241 |
11 | 9700193697811 |
12 | 348546872b261 |
13 | 13b4c35ba9592 |
14 | 767b0b9c0197 |
15 | 376a7b359961 |
hex | 1b81991881a9 |
30243433251241 has 8 divisors (see below), whose sum is σ = 34564060147904. Its totient is φ = 25922840462640.
The previous prime is 30243433251209. The next prime is 30243433251271. The reversal of 30243433251241 is 14215233434203.
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 30243433251241 - 25 = 30243433251209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30243433251241.
It is not an unprimeable number, because it can be changed into a prime (30243433251271) 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, 6597855 + ... + 10198948.
It is an arithmetic number, because the mean of its divisors is an integer number (4320507518488).
Almost surely, 230243433251241 is an apocalyptic number.
It is an amenable number.
30243433251241 is a deficient number, since it is larger than the sum of its proper divisors (4320626896663).
30243433251241 is a wasteful number, since it uses less digits than its factorization.
30243433251241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17054031.
The product of its (nonzero) digits is 207360, while the sum is 37.
Adding to 30243433251241 its reverse (14215233434203), we get a palindrome (44458666685444).
The spelling of 30243433251241 in words is "thirty trillion, two hundred forty-three billion, four hundred thirty-three million, two hundred fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •