Base | Representation |
---|---|
bin | 1101111011001010011010… |
… | …00011100111000000110101 |
3 | 11000102020212102210122122212 |
4 | 12331211031003213000311 |
5 | 13003134443322120140 |
6 | 145042404140103205 |
7 | 6310141662040232 |
oct | 675451503470065 |
9 | 130366772718585 |
10 | 30620114645045 |
11 | 9835a104a8142 |
12 | 3526472534b05 |
13 | 1411606444a93 |
14 | 77c042c3a789 |
15 | 3817759ab765 |
hex | 1bd94d0e7035 |
30620114645045 has 8 divisors (see below), whose sum is σ = 36745975728000. Its totient is φ = 24494866280080.
The previous prime is 30620114645011. The next prime is 30620114645069. The reversal of 30620114645045 is 54054641102603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30620114645045 - 28 = 30620114644789 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30620114644993 and 30620114645011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153069545 + ... + 153269454.
It is an arithmetic number, because the mean of its divisors is an integer number (4593246966000).
Almost surely, 230620114645045 is an apocalyptic number.
It is an amenable number.
30620114645045 is a deficient number, since it is larger than the sum of its proper divisors (6125861082955).
30620114645045 is a wasteful number, since it uses less digits than its factorization.
30620114645045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306358995.
The product of its (nonzero) digits is 345600, while the sum is 41.
Adding to 30620114645045 its reverse (54054641102603), we get a palindrome (84674755747648).
The spelling of 30620114645045 in words is "thirty trillion, six hundred twenty billion, one hundred fourteen million, six hundred forty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •