Base | Representation |
---|---|
bin | 1111110000110001… |
… | …0111101001010100 |
3 | 101220212120012102220 |
4 | 3330030113221110 |
5 | 32131130213022 |
6 | 1535503102340 |
7 | 206564523315 |
oct | 37414275124 |
9 | 11825505386 |
10 | 4231101012 |
11 | 18813898a6 |
12 | 9a0ba19b0 |
13 | 525777b88 |
14 | 2c1d1060c |
15 | 19b6c485c |
hex | fc317a54 |
4231101012 has 48 divisors (see below), whose sum is σ = 10090708992. Its totient is φ = 1379518560.
The previous prime is 4231101001. The next prime is 4231101023. The reversal of 4231101012 is 2101011324.
It is an interprime number because it is at equal distance from previous prime (4231101001) and next prime (4231101023).
It is a junction number, because it is equal to n+sod(n) for n = 4231100982 and 4231101000.
It is a congruent number.
It is an unprimeable number.
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, 88653 + ... + 127755.
It is an arithmetic number, because the mean of its divisors is an integer number (210223104).
Almost surely, 24231101012 is an apocalyptic number.
It is an amenable number.
4231101012 is an abundant number, since it is smaller than the sum of its proper divisors (5859607980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4231101012 is a wasteful number, since it uses less digits than its factorization.
4231101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39308 (or 39306 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 4231101012 is about 65046.9139314080. The cubic root of 4231101012 is about 1617.4013374155.
Adding to 4231101012 its reverse (2101011324), we get a palindrome (6332112336).
The spelling of 4231101012 in words is "four billion, two hundred thirty-one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •