Base | Representation |
---|---|
bin | 1101110110010011011010… |
… | …10110001100110001000101 |
3 | 10222211021220120101020222000 |
4 | 12323021231112030301011 |
5 | 12442421024040232040 |
6 | 144433552445255513 |
7 | 6262111340444124 |
oct | 673115526146105 |
9 | 128737816336860 |
10 | 30453152664645 |
11 | 9781122849077 |
12 | 34ba037264599 |
13 | 13cb948a24539 |
14 | 773d24865abb |
15 | 37c252c15130 |
hex | 1bb26d58cc45 |
30453152664645 has 32 divisors (see below), whose sum is σ = 54172586025600. Its totient is φ = 16231587034752.
The previous prime is 30453152664637. The next prime is 30453152664677. The reversal of 30453152664645 is 54646625135403.
30453152664645 is a `hidden beast` number, since 3 + 0 + 4 + 5 + 31 + 526 + 6 + 46 + 45 = 666.
It is not a de Polignac number, because 30453152664645 - 23 = 30453152664637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30453152664591 and 30453152664600.
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 31 ways as a sum of consecutive naturals, for example, 69881887 + ... + 70316316.
It is an arithmetic number, because the mean of its divisors is an integer number (1692893313300).
Almost surely, 230453152664645 is an apocalyptic number.
It is an amenable number.
30453152664645 is a deficient number, since it is larger than the sum of its proper divisors (23719433360955).
30453152664645 is a wasteful number, since it uses less digits than its factorization.
30453152664645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140199826 (or 140199820 counting only the distinct ones).
The product of its (nonzero) digits is 31104000, while the sum is 54.
The spelling of 30453152664645 in words is "thirty trillion, four hundred fifty-three billion, one hundred fifty-two million, six hundred sixty-four thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •