Base | Representation |
---|---|
bin | 1101110110001101110101… |
… | …10000000001001101000011 |
3 | 10222211000011202012201222112 |
4 | 12323012322300001031003 |
5 | 12442343410003430423 |
6 | 144432335251125535 |
7 | 6261644155040225 |
oct | 673067260011503 |
9 | 128730152181875 |
10 | 30450156311363 |
11 | 977a925449548 |
12 | 34b953b8a38ab |
13 | 13cb58c018b29 |
14 | 773b1c92c415 |
15 | 37c129b41a78 |
hex | 1bb1bac01343 |
30450156311363 has 8 divisors (see below), whose sum is σ = 31500418724400. Its totient is φ = 29399911033248.
The previous prime is 30450156311317. The next prime is 30450156311383. The reversal of 30450156311363 is 36311365105403.
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 30450156311363 - 214 = 30450156294979 is a prime.
It is a super-5 number, since 5×304501563113635 (a number of 69 digits) contains 55555 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30450156311363.
It is not an unprimeable number, because it can be changed into a prime (30450156311383) 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, 615008 + ... + 7828061.
It is an arithmetic number, because the mean of its divisors is an integer number (3937552340550).
Almost surely, 230450156311363 is an apocalyptic number.
30450156311363 is a deficient number, since it is larger than the sum of its proper divisors (1050262413037).
30450156311363 is a wasteful number, since it uses less digits than its factorization.
30450156311363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8567461.
The product of its (nonzero) digits is 291600, while the sum is 41.
The spelling of 30450156311363 in words is "thirty trillion, four hundred fifty billion, one hundred fifty-six million, three hundred eleven thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •