Base | Representation |
---|---|
bin | 1101011101011100011… |
… | …0010100010001000010 |
3 | 211002212122122221111111 |
4 | 3113113012110101002 |
5 | 12242040424232002 |
6 | 254121531033534 |
7 | 22464251526043 |
oct | 3272706242102 |
9 | 732778587444 |
10 | 231242024002 |
11 | 8a084104250 |
12 | 3899659b8aa |
13 | 18a62b00602 |
14 | b2994788ca |
15 | 603613a3d7 |
hex | 35d7194442 |
231242024002 has 8 divisors (see below), whose sum is σ = 378396039312. Its totient is φ = 105110010900.
The previous prime is 231242023997. The next prime is 231242024023. The reversal of 231242024002 is 200420242132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 10511001091 = 231242024002 / (2 + 3 + 1 + 2 + 4 + 2 + 0 + 2 + 4 + 0 + 0 + 2).
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 3 ways as a sum of consecutive naturals, for example, 5255500524 + ... + 5255500567.
It is an arithmetic number, because the mean of its divisors is an integer number (47299504914).
Almost surely, 2231242024002 is an apocalyptic number.
231242024002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
231242024002 is a deficient number, since it is larger than the sum of its proper divisors (147154015310).
231242024002 is a wasteful number, since it uses less digits than its factorization.
231242024002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10511001104.
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 231242024002 its reverse (200420242132), we get a palindrome (431662266134).
The spelling of 231242024002 in words is "two hundred thirty-one billion, two hundred forty-two million, twenty-four thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •