Base | Representation |
---|---|
bin | 1111101001011011… |
… | …1010110011000000 |
3 | 101211201121221212010 |
4 | 3322112322303000 |
5 | 32100234441000 |
6 | 1532443132520 |
7 | 206042030403 |
oct | 37226726300 |
9 | 11751557763 |
10 | 4200312000 |
11 | 1865a6a635 |
12 | 992814140 |
13 | 51c287a21 |
14 | 2bbbb7d3a |
15 | 198b41d50 |
hex | fa5bacc0 |
4200312000 has 112 divisors (see below), whose sum is σ = 13869509472. Its totient is φ = 1120076800.
The previous prime is 4200311917. The next prime is 4200312001. The reversal of 4200312000 is 2130024.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (4200312001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63507 + ... + 111506.
It is an arithmetic number, because the mean of its divisors is an integer number (123834906).
Almost surely, 24200312000 is an apocalyptic number.
4200312000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4200312000 is an abundant number, since it is smaller than the sum of its proper divisors (9669197472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4200312000 is a wasteful number, since it uses less digits than its factorization.
4200312000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175043 (or 175023 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 4200312000 is about 64809.8140716358. The cubic root of 4200312000 is about 1613.4685966018.
Adding to 4200312000 its reverse (2130024), we get a palindrome (4202442024).
The spelling of 4200312000 in words is "four billion, two hundred million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •