Base | Representation |
---|---|
bin | 1000101011110011… |
… | …1111110111011010 |
3 | 20000110122120101000 |
4 | 2022330333313122 |
5 | 14233244333132 |
6 | 1023154405430 |
7 | 111525156456 |
oct | 21274776732 |
9 | 6013576330 |
10 | 2331246042 |
11 | a96a22724 |
12 | 550890876 |
13 | 2b1c95338 |
14 | 181883666 |
15 | d99e487c |
hex | 8af3fdda |
2331246042 has 16 divisors (see below), whose sum is σ = 5180546880. Its totient is φ = 777081996.
The previous prime is 2331246041. The next prime is 2331246061. The reversal of 2331246042 is 2406421332.
2331246042 is a `hidden beast` number, since 2 + 3 + 31 + 24 + 604 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2331245997 and 2331246015.
It is not an unprimeable number, because it can be changed into a prime (2331246041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21585558 + ... + 21585665.
It is an arithmetic number, because the mean of its divisors is an integer number (323784180).
Almost surely, 22331246042 is an apocalyptic number.
2331246042 is an abundant number, since it is smaller than the sum of its proper divisors (2849300838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2331246042 is a wasteful number, since it uses less digits than its factorization.
2331246042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43171234 (or 43171228 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 2331246042 is about 48282.9788020582. The cubic root of 2331246042 is about 1325.9567869458.
Adding to 2331246042 its reverse (2406421332), we get a palindrome (4737667374).
The spelling of 2331246042 in words is "two billion, three hundred thirty-one million, two hundred forty-six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •