Base | Representation |
---|---|
bin | 1101110110001110010100… |
… | …01011110001000101111011 |
3 | 10222211000211210102212021222 |
4 | 12323013022023301011323 |
5 | 12442344422300244033 |
6 | 144432421101022255 |
7 | 6261653450653643 |
oct | 673071213610573 |
9 | 128730753385258 |
10 | 30450415243643 |
11 | 977aa4862316a |
12 | 34b95b255498b |
13 | 13cb6008680b5 |
14 | 773b45091523 |
15 | 37c14273c598 |
hex | 1bb1ca2f117b |
30450415243643 has 8 divisors (see below), whose sum is σ = 31317383640816. Its totient is φ = 29589364720000.
The previous prime is 30450415243607. The next prime is 30450415243657. The reversal of 30450415243643 is 34634251405403.
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 30450415243643 - 212 = 30450415239547 is a prime.
It is a super-2 number, since 2×304504152436432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30450415243594 and 30450415243603.
It is not an unprimeable number, because it can be changed into a prime (30450415263643) 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, 1479457946 + ... + 1479478527.
It is an arithmetic number, because the mean of its divisors is an integer number (3914672955102).
Almost surely, 230450415243643 is an apocalyptic number.
30450415243643 is a deficient number, since it is larger than the sum of its proper divisors (866968397173).
30450415243643 is a wasteful number, since it uses less digits than its factorization.
30450415243643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2958936765.
The product of its (nonzero) digits is 2073600, while the sum is 44.
The spelling of 30450415243643 in words is "thirty trillion, four hundred fifty billion, four hundred fifteen million, two hundred forty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •