Base | Representation |
---|---|
bin | 101111000000010001101… |
… | …011011010100100101100 |
3 | 102102210111001121001211220 |
4 | 233000101223122210230 |
5 | 410410232133002200 |
6 | 10511520514143340 |
7 | 452240120662323 |
oct | 57002153324454 |
9 | 12383431531756 |
10 | 3230112000300 |
11 | 1035979019439 |
12 | 442025b81b50 |
13 | 1a57a1499b23 |
14 | b24a42590ba |
15 | 590515674a0 |
hex | 2f011ada92c |
3230112000300 has 72 divisors (see below), whose sum is σ = 9647267868672. Its totient is φ = 833577288000.
The previous prime is 3230112000299. The next prime is 3230112000317. The reversal of 3230112000300 is 30002110323.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 3230112000300.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 173652636 + ... + 173671235.
Almost surely, 23230112000300 is an apocalyptic number.
3230112000300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3230112000300 is an abundant number, since it is smaller than the sum of its proper divisors (6417155868372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3230112000300 is a wasteful number, since it uses less digits than its factorization.
3230112000300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347323919 (or 347323912 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 3230112000300 its reverse (30002110323), we get a palindrome (3260114110623).
The spelling of 3230112000300 in words is "three trillion, two hundred thirty billion, one hundred twelve million, three hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •