Base | Representation |
---|---|
bin | 10111110000100000101010… |
… | …11101001001110010010101 |
3 | 20211222111210000212112022220 |
4 | 23320100111131021302111 |
5 | 23321432403042333331 |
6 | 303040415222412553 |
7 | 14001346334101233 |
oct | 1370202535116225 |
9 | 224874700775286 |
10 | 52244342152341 |
11 | 15712779157469 |
12 | 5a39378591159 |
13 | 231c80ab16681 |
14 | cc88d52c3953 |
15 | 608eddda7296 |
hex | 2f8415749c95 |
52244342152341 has 8 divisors (see below), whose sum is σ = 69677488063680. Its totient is φ = 34820378837952.
The previous prime is 52244342152339. The next prime is 52244342152351. The reversal of 52244342152341 is 14325124344225.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52244342152341 - 21 = 52244342152339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52244342152293 and 52244342152302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52244342152351) 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, 2295635961 + ... + 2295658718.
It is an arithmetic number, because the mean of its divisors is an integer number (8709686007960).
Almost surely, 252244342152341 is an apocalyptic number.
It is an amenable number.
52244342152341 is a deficient number, since it is larger than the sum of its proper divisors (17433145911339).
52244342152341 is a wasteful number, since it uses less digits than its factorization.
52244342152341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4591298475.
The product of its digits is 921600, while the sum is 42.
Adding to 52244342152341 its reverse (14325124344225), we get a palindrome (66569466496566).
The spelling of 52244342152341 in words is "fifty-two trillion, two hundred forty-four billion, three hundred forty-two million, one hundred fifty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •