Base | Representation |
---|---|
bin | 1101101011010011000101… |
… | …00010001010101010011111 |
3 | 10221111010212110000102002122 |
4 | 12311221202202022222133 |
5 | 12420222112104132320 |
6 | 143544134252213155 |
7 | 6222563613104516 |
oct | 665514242125237 |
9 | 127433773012078 |
10 | 30075014130335 |
11 | 9645818471499 |
12 | 34588a546a1bb |
13 | 13a20a5622015 |
14 | 75d8d1ca167d |
15 | 3724c06d2d25 |
hex | 1b5a6288aa9f |
30075014130335 has 8 divisors (see below), whose sum is σ = 38212959130416. Its totient is φ = 22644716521600.
The previous prime is 30075014130313. The next prime is 30075014130379. The reversal of 30075014130335 is 53303141057003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30075014130335 - 214 = 30075014113951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30075014130295 and 30075014130304.
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, 176911847741 + ... + 176911847910.
It is an arithmetic number, because the mean of its divisors is an integer number (4776619891302).
Almost surely, 230075014130335 is an apocalyptic number.
30075014130335 is a deficient number, since it is larger than the sum of its proper divisors (8137945000081).
30075014130335 is a wasteful number, since it uses less digits than its factorization.
30075014130335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353823695673.
The product of its (nonzero) digits is 56700, while the sum is 35.
Adding to 30075014130335 its reverse (53303141057003), we get a palindrome (83378155187338).
The spelling of 30075014130335 in words is "thirty trillion, seventy-five billion, fourteen million, one hundred thirty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •