Base | Representation |
---|---|
bin | 1000111010001101100… |
… | …1001110001000001011 |
3 | 112122002101002102101001 |
4 | 2032203121032020023 |
5 | 10001434134344120 |
6 | 154152301235431 |
7 | 14026045222324 |
oct | 2164331161013 |
9 | 478071072331 |
10 | 153065153035 |
11 | 59a07319a83 |
12 | 257b9262b77 |
13 | 115845c6292 |
14 | 75a08b744b |
15 | 3eacc42e0a |
hex | 23a364e20b |
153065153035 has 4 divisors (see below), whose sum is σ = 183678183648. Its totient is φ = 122452122424.
The previous prime is 153065153009. The next prime is 153065153081. The reversal of 153065153035 is 530351560351.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 530351560351 = 41 ⋅12935403911.
It is a cyclic number.
It is not a de Polignac number, because 153065153035 - 231 = 150917669387 is a prime.
It is a super-2 number, since 2×1530651530352 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 153065152985 and 153065153003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15306515299 + ... + 15306515308.
It is an arithmetic number, because the mean of its divisors is an integer number (45919545912).
Almost surely, 2153065153035 is an apocalyptic number.
153065153035 is a deficient number, since it is larger than the sum of its proper divisors (30613030613).
153065153035 is an equidigital number, since it uses as much as digits as its factorization.
153065153035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30613030612.
The product of its (nonzero) digits is 101250, while the sum is 37.
The spelling of 153065153035 in words is "one hundred fifty-three billion, sixty-five million, one hundred fifty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •