Base | Representation |
---|---|
bin | 110111101101100100101011… |
… | …111000001000100111011111 |
3 | 1012010120002121112012210221121 |
4 | 313231210223320020213133 |
5 | 224103434304300431101 |
6 | 2225042342100111411 |
7 | 102416265125564155 |
oct | 6755445370104737 |
9 | 1163502545183847 |
10 | 245024325405151 |
11 | 71088261a138a6 |
12 | 23593432995567 |
13 | a69490546b456 |
14 | 44713523c93d5 |
15 | 1d4d9a1d4a0a1 |
hex | ded92be089df |
245024325405151 has 16 divisors (see below), whose sum is σ = 246743943411168. Its totient is φ = 243307382947200.
The previous prime is 245024325405137. The next prime is 245024325405199. The reversal of 245024325405151 is 151504523420542.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-245024325405151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 245024325405098 and 245024325405107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245024325405131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2460503181 + ... + 2460602761.
It is an arithmetic number, because the mean of its divisors is an integer number (15421496463198).
Almost surely, 2245024325405151 is an apocalyptic number.
245024325405151 is a deficient number, since it is larger than the sum of its proper divisors (1719618006017).
245024325405151 is a wasteful number, since it uses less digits than its factorization.
245024325405151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112842.
The product of its (nonzero) digits is 960000, while the sum is 43.
Adding to 245024325405151 its reverse (151504523420542), we get a palindrome (396528848825693).
The spelling of 245024325405151 in words is "two hundred forty-five trillion, twenty-four billion, three hundred twenty-five million, four hundred five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •