Base | Representation |
---|---|
bin | 1000111001010010001… |
… | …10110101101010011100 |
3 | 1002012220001011100222011 |
4 | 10130221012311222130 |
5 | 20001413334232130 |
6 | 352223333401004 |
7 | 31036565665516 |
oct | 4345106655234 |
9 | 1065801140864 |
10 | 305632336540 |
11 | 108688539093 |
12 | 4b297799164 |
13 | 22a8999871b |
14 | 10b151a6bb6 |
15 | 7e3bdbe52a |
hex | 47291b5a9c |
305632336540 has 24 divisors (see below), whose sum is σ = 659174608512. Its totient is φ = 118948800960.
The previous prime is 305632336519. The next prime is 305632336543. The reversal of 305632336540 is 45633236503.
It is a super-2 number, since 2×3056323365402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 305632336493 and 305632336502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305632336543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206507596 + ... + 206509075.
It is an arithmetic number, because the mean of its divisors is an integer number (27465608688).
Almost surely, 2305632336540 is an apocalyptic number.
It is an amenable number.
305632336540 is an abundant number, since it is smaller than the sum of its proper divisors (353542271972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305632336540 is a wasteful number, since it uses less digits than its factorization.
305632336540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413016717 (or 413016715 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 40.
The spelling of 305632336540 in words is "three hundred five billion, six hundred thirty-two million, three hundred thirty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •