Base | Representation |
---|---|
bin | 1011000010001001100110… |
… | …11011101000010101110010 |
3 | 10011220112101110120111202120 |
4 | 11201010303123220111302 |
5 | 11140011344040324432 |
6 | 123334155100255110 |
7 | 5052645025544520 |
oct | 541046333502562 |
9 | 104815343514676 |
10 | 24263133136242 |
11 | 7804a34131560 |
12 | 287a436241496 |
13 | 1070007cb6190 |
14 | 5dc4b02b3310 |
15 | 2c1216b09c2c |
hex | 1611336e8572 |
24263133136242 has 128 divisors (see below), whose sum is σ = 66222249504768. Its totient is φ = 5721968390400.
The previous prime is 24263133136223. The next prime is 24263133136247.
24263133136242 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 24263133136194 and 24263133136203.
It is not an unprimeable number, because it can be changed into a prime (24263133136247) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32746878 + ... + 33479609.
It is an arithmetic number, because the mean of its divisors is an integer number (517361324256).
Almost surely, 224263133136242 is an apocalyptic number.
24263133136242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
24263133136242 is an abundant number, since it is smaller than the sum of its proper divisors (41959116368526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24263133136242 is a wasteful number, since it uses less digits than its factorization.
24263133136242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66226584.
The product of its digits is 746496, while the sum is 42.
The spelling of 24263133136242 in words is "twenty-four trillion, two hundred sixty-three billion, one hundred thirty-three million, one hundred thirty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •