Base | Representation |
---|---|
bin | 11111110111100001100010… |
… | …110010011111010001010101 |
3 | 200101020200122000220222020002 |
4 | 133313201202302133101111 |
5 | 121332300000213034100 |
6 | 1214030155414221045 |
7 | 41343603206220416 |
oct | 3767414262372125 |
9 | 611220560828202 |
10 | 140155030205525 |
11 | 40726461798245 |
12 | 13876b98054785 |
13 | 602874116611a |
14 | 268777ab6380d |
15 | 1130b499dc2d5 |
hex | 7f7862c9f455 |
140155030205525 has 48 divisors (see below), whose sum is σ = 174604730464464. Its totient is φ = 111601049978880.
The previous prime is 140155030205503. The next prime is 140155030205563. The reversal of 140155030205525 is 525502030551041.
It can be written as a sum of positive squares in 24 ways, for example, as 138815311924081 + 1339718281444 = 11781991^2 + 1157462^2 .
It is not a de Polignac number, because 140155030205525 - 212 = 140155030201429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16851628667 + ... + 16851636983.
It is an arithmetic number, because the mean of its divisors is an integer number (3637598551343).
Almost surely, 2140155030205525 is an apocalyptic number.
It is an amenable number.
140155030205525 is a deficient number, since it is larger than the sum of its proper divisors (34449700258939).
140155030205525 is a wasteful number, since it uses less digits than its factorization.
140155030205525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11610 (or 11605 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 38.
Adding to 140155030205525 its reverse (525502030551041), we get a palindrome (665657060756566).
The spelling of 140155030205525 in words is "one hundred forty trillion, one hundred fifty-five billion, thirty million, two hundred five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •