Base | Representation |
---|---|
bin | 1000111011010100101… |
… | …1110000001011111101 |
3 | 112122212011200201200002 |
4 | 2032311023300023331 |
5 | 10003042041044123 |
6 | 154242042244045 |
7 | 14036331124304 |
oct | 2166513601375 |
9 | 478764621602 |
10 | 153363612413 |
11 | 5a04a840a20 |
12 | 258811b6625 |
13 | 116013a4a6b |
14 | 75cc3a943b |
15 | 3ec904a528 |
hex | 23b52f02fd |
153363612413 has 4 divisors (see below), whose sum is σ = 167305759008. Its totient is φ = 139421465820.
The previous prime is 153363612403. The next prime is 153363612431. The reversal of 153363612413 is 314216363351.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 153363612413 - 24 = 153363612397 is a prime.
It is a super-2 number, since 2×1533636124132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153363612403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6971073281 + ... + 6971073302.
It is an arithmetic number, because the mean of its divisors is an integer number (41826439752).
Almost surely, 2153363612413 is an apocalyptic number.
It is an amenable number.
153363612413 is a deficient number, since it is larger than the sum of its proper divisors (13942146595).
153363612413 is a wasteful number, since it uses less digits than its factorization.
153363612413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13942146594.
The product of its digits is 116640, while the sum is 38.
Adding to 153363612413 its reverse (314216363351), we get a palindrome (467579975764).
The spelling of 153363612413 in words is "one hundred fifty-three billion, three hundred sixty-three million, six hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •