Base | Representation |
---|---|
bin | 1001110100110001… |
… | …01001010001100000 |
3 | 111121120220200110112 |
4 | 10322120221101200 |
5 | 41300233200321 |
6 | 2231214550452 |
7 | 244464364331 |
oct | 47230512140 |
9 | 14546820415 |
10 | 5274506336 |
11 | 2267359750 |
12 | 1032508428 |
13 | 6609a1888 |
14 | 38071a288 |
15 | 20d0cba5b |
hex | 13a629460 |
5274506336 has 48 divisors (see below), whose sum is σ = 11604530448. Its totient is φ = 2339020800.
The previous prime is 5274506329. The next prime is 5274506353. The reversal of 5274506336 is 6336054725.
It is a super-3 number, since 3×52745063363 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a junction number, because it is equal to n+sod(n) for n = 5274506293 and 5274506302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168305 + ... + 197168.
It is an arithmetic number, because the mean of its divisors is an integer number (241761051).
Almost surely, 25274506336 is an apocalyptic number.
It is an amenable number.
5274506336 is an abundant number, since it is smaller than the sum of its proper divisors (6330024112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5274506336 is a wasteful number, since it uses less digits than its factorization.
5274506336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365535 (or 365527 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 41.
The square root of 5274506336 is about 72625.7966290216. The cubic root of 5274506336 is about 1740.7134010398.
The spelling of 5274506336 in words is "five billion, two hundred seventy-four million, five hundred six thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •