Base | Representation |
---|---|
bin | 101010100111110… |
… | …100010101111001 |
3 | 1211211112212211111 |
4 | 222213310111321 |
5 | 2431030043311 |
6 | 154542400321 |
7 | 23502042331 |
oct | 5247642571 |
9 | 1754485744 |
10 | 715081081 |
11 | 337710000 |
12 | 17b5900a1 |
13 | b51bc900 |
14 | 6ad820c1 |
15 | 42ba0d21 |
hex | 2a9f4579 |
715081081 has 45 divisors (see below), whose sum is σ = 904795005. Its totient is φ = 564769920.
The previous prime is 715081079. The next prime is 715081097. The reversal of 715081081 is 180180517.
The square root of 715081081 is 26741.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 6456681 + 708624400 = 2541^2 + 26620^2 .
It is not a de Polignac number, because 715081081 - 21 = 715081079 is a prime.
It is a super-2 number, since 2×7150810812 = 1022681904808257122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (715081021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 42063585 + ... + 42063601.
Almost surely, 2715081081 is an apocalyptic number.
715081081 is the 26741-st square number.
715081081 is the 13371-st centered octagonal number.
It is an amenable number.
715081081 is a deficient number, since it is larger than the sum of its proper divisors (189713924).
715081081 is an equidigital number, since it uses as much as digits as its factorization.
715081081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 31.
The cubic root of 715081081 is about 894.2352032096.
The spelling of 715081081 in words is "seven hundred fifteen million, eighty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •