Base | Representation |
---|---|
bin | 100011010000101111000… |
… | …001011001011000100101 |
3 | 22120122120112001221102212 |
4 | 203100233001121120211 |
5 | 304200103003401323 |
6 | 5053102511413205 |
7 | 340031632662023 |
oct | 43205701313045 |
9 | 8518515057385 |
10 | 2423150450213 |
11 | 85471a292069 |
12 | 331758224205 |
13 | 14766b18a65c |
14 | 853d1505713 |
15 | 43072003b78 |
hex | 2342f059625 |
2423150450213 has 8 divisors (see below), whose sum is σ = 2484386081856. Its totient is φ = 2362016456800.
The previous prime is 2423150450183. The next prime is 2423150450261. The reversal of 2423150450213 is 3120540513242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2423150450213 - 220 = 2423149401637 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2423150450213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2423150450263) 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, 25361273 + ... + 25456638.
It is an arithmetic number, because the mean of its divisors is an integer number (310548260232).
Almost surely, 22423150450213 is an apocalyptic number.
It is an amenable number.
2423150450213 is a deficient number, since it is larger than the sum of its proper divisors (61235631643).
2423150450213 is a wasteful number, since it uses less digits than its factorization.
2423150450213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50819115.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 2423150450213 its reverse (3120540513242), we get a palindrome (5543690963455).
The spelling of 2423150450213 in words is "two trillion, four hundred twenty-three billion, one hundred fifty million, four hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •