Base | Representation |
---|---|
bin | 10001111001110000001… |
… | …001111110100000001011 |
3 | 11100121110200221122101202 |
4 | 101321300021332200023 |
5 | 130124014012411110 |
6 | 2341055430134415 |
7 | 154611360045335 |
oct | 21716011764013 |
9 | 4317420848352 |
10 | 1230242310155 |
11 | 434819791351 |
12 | 17a5197b140b |
13 | 8c01bc2c2a1 |
14 | 43788c0a455 |
15 | 22004c2a0a5 |
hex | 11e7027e80b |
1230242310155 has 16 divisors (see below), whose sum is σ = 1565989109280. Its totient is φ = 924606638592.
The previous prime is 1230242310137. The next prime is 1230242310173. The reversal of 1230242310155 is 5510132420321.
It is an interprime number because it is at equal distance from previous prime (1230242310137) and next prime (1230242310173).
It is a cyclic number.
It is not a de Polignac number, because 1230242310155 - 218 = 1230242048011 is a prime.
It is a super-2 number, since 2×12302423101552 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13183340 + ... + 13276329.
It is an arithmetic number, because the mean of its divisors is an integer number (97874319330).
Almost surely, 21230242310155 is an apocalyptic number.
1230242310155 is a deficient number, since it is larger than the sum of its proper divisors (335746799125).
1230242310155 is a wasteful number, since it uses less digits than its factorization.
1230242310155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26460238.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 1230242310155 its reverse (5510132420321), we get a palindrome (6740374730476).
The spelling of 1230242310155 in words is "one trillion, two hundred thirty billion, two hundred forty-two million, three hundred ten thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •