Base | Representation |
---|---|
bin | 1101111000111001100001… |
… | …01110111001111101000111 |
3 | 11000010211002111100112000121 |
4 | 12330130300232321331013 |
5 | 13000401142442403411 |
6 | 144542541442122411 |
7 | 6301416260612335 |
oct | 674346056717507 |
9 | 130124074315017 |
10 | 30542330044231 |
11 | 9805a25089285 |
12 | 3513384650407 |
13 | 140718b2a3875 |
14 | 7783843cab55 |
15 | 37e721c4c571 |
hex | 1bc730bb9f47 |
30542330044231 has 4 divisors (see below), whose sum is σ = 30547880173312. Its totient is φ = 30536779915152.
The previous prime is 30542330044223. The next prime is 30542330044243. The reversal of 30542330044231 is 13244003324503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30542330044231 - 23 = 30542330044223 is a prime.
It is a super-2 number, since 2×305423300442312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30542330054231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2775056286 + ... + 2775067291.
It is an arithmetic number, because the mean of its divisors is an integer number (7636970043328).
Almost surely, 230542330044231 is an apocalyptic number.
30542330044231 is a deficient number, since it is larger than the sum of its proper divisors (5550129081).
30542330044231 is an equidigital number, since it uses as much as digits as its factorization.
30542330044231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5550129080.
The product of its (nonzero) digits is 103680, while the sum is 34.
Adding to 30542330044231 its reverse (13244003324503), we get a palindrome (43786333368734).
The spelling of 30542330044231 in words is "thirty trillion, five hundred forty-two billion, three hundred thirty million, forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.785 sec. • engine limits •