Base | Representation |
---|---|
bin | 100110001001100011111… |
… | …0111010011110101000010 |
3 | 200120020122112210012000220 |
4 | 1030103013313103311002 |
5 | 1141401100044004432 |
6 | 15052410544523510 |
7 | 1050544466262120 |
oct | 114230767236502 |
9 | 20506575705026 |
10 | 5243213266242 |
11 | 17416a8220236 |
12 | 708205620596 |
13 | 2c058209a963 |
14 | 141ab6ab4910 |
15 | 915c47eb72c |
hex | 4c4c7dd3d42 |
5243213266242 has 128 divisors (see below), whose sum is σ = 12094540800000. Its totient is φ = 1484380795392.
The previous prime is 5243213266241. The next prime is 5243213266271. The reversal of 5243213266242 is 2426623123425.
It is a super-2 number, since 2×52432132662422 (a number of 26 digits) contains 22 as substring.
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 = 5243213266194 and 5243213266203.
It is not an unprimeable number, because it can be changed into a prime (5243213266241) 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, 3141528984 + ... + 3141530652.
It is an arithmetic number, because the mean of its divisors is an integer number (94488600000).
Almost surely, 25243213266242 is an apocalyptic number.
5243213266242 is an abundant number, since it is smaller than the sum of its proper divisors (6851327533758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5243213266242 is a wasteful number, since it uses less digits than its factorization.
5243213266242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3208.
The product of its digits is 829440, while the sum is 42.
Adding to 5243213266242 its reverse (2426623123425), we get a palindrome (7669836389667).
The spelling of 5243213266242 in words is "five trillion, two hundred forty-three billion, two hundred thirteen million, two hundred sixty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •