Base | Representation |
---|---|
bin | 1101101111000011111010… |
… | …0101110101111000010111 |
3 | 1222110202022011020011120010 |
4 | 3123300332211311320113 |
5 | 3434413203202321101 |
6 | 52041500112211303 |
7 | 3116044324323201 |
oct | 333607645657027 |
9 | 58422264204503 |
10 | 15102155120151 |
11 | 48a2873942310 |
12 | 183aa95239b33 |
13 | 857186378b38 |
14 | 3a2d3bc4d771 |
15 | 1b2c95ba32d6 |
hex | dbc3e975e17 |
15102155120151 has 32 divisors (see below), whose sum is σ = 22046360633856. Its totient is φ = 9119663168000.
The previous prime is 15102155120131. The next prime is 15102155120189.
15102155120151 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 15102155120151 - 219 = 15102154595863 is a prime.
It is a super-3 number, since 3×151021551201513 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15102155120131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 176431675 + ... + 176517251.
It is an arithmetic number, because the mean of its divisors is an integer number (688948769808).
Almost surely, 215102155120151 is an apocalyptic number.
15102155120151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
15102155120151 is a deficient number, since it is larger than the sum of its proper divisors (6944205513705).
15102155120151 is a wasteful number, since it uses less digits than its factorization.
15102155120151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104903.
The product of its (nonzero) digits is 2500, while the sum is 30.
It can be divided in two parts, 1510215 and 5120151, that added together give a palindrome (6630366).
The spelling of 15102155120151 in words is "fifteen trillion, one hundred two billion, one hundred fifty-five million, one hundred twenty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •