Base | Representation |
---|---|
bin | 100010110011100011001110… |
… | …111011110110111000001101 |
3 | 202001222221012001000222202201 |
4 | 202303203032323312320031 |
5 | 130030444331143232323 |
6 | 1301322105320121501 |
7 | 44146245420235021 |
oct | 4263431673667015 |
9 | 661887161028681 |
10 | 153076106227213 |
11 | 44858237308984 |
12 | 15203212306291 |
13 | 67550268c3250 |
14 | 29b2ccccaa381 |
15 | 12a6cda3a18ad |
hex | 8b38ceef6e0d |
153076106227213 has 16 divisors (see below), whose sum is σ = 165273451862400. Its totient is φ = 140939503683264.
The previous prime is 153076106227211. The next prime is 153076106227229. The reversal of 153076106227213 is 312722601670351.
It is not a de Polignac number, because 153076106227213 - 21 = 153076106227211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153076106227211) 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, 7606 + ... + 17497207.
It is an arithmetic number, because the mean of its divisors is an integer number (10329590741400).
Almost surely, 2153076106227213 is an apocalyptic number.
153076106227213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
153076106227213 is a deficient number, since it is larger than the sum of its proper divisors (12197345635187).
153076106227213 is a wasteful number, since it uses less digits than its factorization.
153076106227213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17506548.
The product of its (nonzero) digits is 635040, while the sum is 46.
Adding to 153076106227213 its reverse (312722601670351), we get a palindrome (465798707897564).
The spelling of 153076106227213 in words is "one hundred fifty-three trillion, seventy-six billion, one hundred six million, two hundred twenty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •