Base | Representation |
---|---|
bin | 1101110110000010111100… |
… | …1010100110100011101111 |
3 | 1222220020001011221021112221 |
4 | 3131200233022212203233 |
5 | 3443344433240434201 |
6 | 52212543414540211 |
7 | 3130523126034523 |
oct | 335405712464357 |
9 | 58806034837487 |
10 | 15222155405551 |
11 | 49397529818a6 |
12 | 185a1a5067667 |
13 | 86559b633083 |
14 | 3a8a8322bd83 |
15 | 1b5e6abb34a1 |
hex | dd82f2a68ef |
15222155405551 has 4 divisors (see below), whose sum is σ = 15224933683600. Its totient is φ = 15219377127504.
The previous prime is 15222155405503. The next prime is 15222155405593. The reversal of 15222155405551 is 15550455122251.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 15222155405551 - 217 = 15222155274479 is a prime.
It is a super-2 number, since 2×152221554055512 (a number of 27 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 = 15222155405498 and 15222155405507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15222155403551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1389130806 + ... + 1389141763.
It is an arithmetic number, because the mean of its divisors is an integer number (3806233420900).
Almost surely, 215222155405551 is an apocalyptic number.
15222155405551 is a deficient number, since it is larger than the sum of its proper divisors (2778278049).
15222155405551 is an equidigital number, since it uses as much as digits as its factorization.
15222155405551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2778278048.
The product of its (nonzero) digits is 500000, while the sum is 43.
The spelling of 15222155405551 in words is "fifteen trillion, two hundred twenty-two billion, one hundred fifty-five million, four hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •