Base | Representation |
---|---|
bin | 1101000100010010001010… |
… | …10110000110010110110100 |
3 | 10202201222202100002010201210 |
4 | 12202021011112012112310 |
5 | 12231241221111200343 |
6 | 141040240011121420 |
7 | 6023666364264042 |
oct | 642110526062664 |
9 | 122658670063653 |
10 | 28734494631348 |
11 | 917925a126a60 |
12 | 3280b30143270 |
13 | 1305860953b9c |
14 | 714a85159392 |
15 | 34c6b43aa333 |
hex | 1a22455865b4 |
28734494631348 has 24 divisors (see below), whose sum is σ = 73142349971040. Its totient is φ = 8707422615520.
The previous prime is 28734494631341. The next prime is 28734494631391. The reversal of 28734494631348 is 84313649443782.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28734494631341) 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, 108842782563 + ... + 108842782826.
It is an arithmetic number, because the mean of its divisors is an integer number (3047597915460).
Almost surely, 228734494631348 is an apocalyptic number.
It is an amenable number.
28734494631348 is an abundant number, since it is smaller than the sum of its proper divisors (44407855339692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28734494631348 is a wasteful number, since it uses less digits than its factorization.
28734494631348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217685565407 (or 217685565405 counting only the distinct ones).
The product of its digits is 334430208, while the sum is 66.
The spelling of 28734494631348 in words is "twenty-eight trillion, seven hundred thirty-four billion, four hundred ninety-four million, six hundred thirty-one thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •