Base | Representation |
---|---|
bin | 10101110110011000011… |
… | …000001001111000001011 |
3 | 12022112122010020211102001 |
4 | 111312120120021320023 |
5 | 144100033003230201 |
6 | 3105440221051431 |
7 | 213323366612623 |
oct | 25663030117013 |
9 | 5275563224361 |
10 | 1501500055051 |
11 | 529867700a07 |
12 | 2030013b6b77 |
13 | ab78b127949 |
14 | 5295c985883 |
15 | 290cde05301 |
hex | 15d98609e0b |
1501500055051 has 2 divisors, whose sum is σ = 1501500055052. Its totient is φ = 1501500055050.
The previous prime is 1501500055031. The next prime is 1501500055073. The reversal of 1501500055051 is 1505500051051.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1501500055051 - 25 = 1501500055019 is a prime.
It is a super-2 number, since 2×15015000550512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1501500055021) by changing a digit.
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 as a sum of consecutive naturals, namely, 750750027525 + 750750027526.
It is an arithmetic number, because the mean of its divisors is an integer number (750750027526).
Almost surely, 21501500055051 is an apocalyptic number.
1501500055051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1501500055051 is an equidigital number, since it uses as much as digits as its factorization.
1501500055051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 1501500055051 in words is "one trillion, five hundred one billion, five hundred million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •