Base | Representation |
---|---|
bin | 1101101111010001001100… |
… | …01010110011100111101001 |
3 | 10221222012000012222021111201 |
4 | 12313220212022303213221 |
5 | 12424441012210432040 |
6 | 144130535531124201 |
7 | 6235463440460530 |
oct | 667504612634751 |
9 | 127865005867451 |
10 | 30211440327145 |
11 | 96986664aa380 |
12 | 347b21a2a3661 |
13 | 13b1c07976a6c |
14 | 7663549dd317 |
15 | 375d077b9a9a |
hex | 1b7a262b39e9 |
30211440327145 has 64 divisors (see below), whose sum is σ = 46284324286464. Its totient is φ = 18381714865920.
The previous prime is 30211440327109. The next prime is 30211440327151. The reversal of 30211440327145 is 54172304411203.
It is not a de Polignac number, because 30211440327145 - 211 = 30211440325097 is a prime.
It is a super-3 number, since 3×302114403271453 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 22065444 + ... + 23394586.
It is an arithmetic number, because the mean of its divisors is an integer number (723192566976).
Almost surely, 230211440327145 is an apocalyptic number.
30211440327145 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30211440327145 is a deficient number, since it is larger than the sum of its proper divisors (16072883959319).
30211440327145 is a wasteful number, since it uses less digits than its factorization.
30211440327145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1330582.
The product of its (nonzero) digits is 80640, while the sum is 37.
Adding to 30211440327145 its reverse (54172304411203), we get a palindrome (84383744738348).
The spelling of 30211440327145 in words is "thirty trillion, two hundred eleven billion, four hundred forty million, three hundred twenty-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •