Base | Representation |
---|---|
bin | 1010101011011000101011… |
… | …00000001111111001111101 |
3 | 10002010202102120022220220111 |
4 | 11111230111200033321331 |
5 | 11034202434411420100 |
6 | 121534555332350021 |
7 | 4642304520126424 |
oct | 525542540177175 |
9 | 102122376286814 |
10 | 23480946982525 |
11 | 753323947417a |
12 | 2772921775311 |
13 | 1014322820266 |
14 | 5b26abb5c2bb |
15 | 2aabd769e6ba |
hex | 155b1580fe7d |
23480946982525 has 6 divisors (see below), whose sum is σ = 29116374258362. Its totient is φ = 18784757586000.
The previous prime is 23480946982457. The next prime is 23480946982543. The reversal of 23480946982525 is 52528964908432.
It can be written as a sum of positive squares in 3 ways, for example, as 1278624962169 + 22202322020356 = 1130763^2 + 4711934^2 .
It is not a de Polignac number, because 23480946982525 - 219 = 23480946458237 is a prime.
It is a super-2 number, since 2×234809469825252 (a number of 28 digits) contains 22 as substring.
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 5 ways as a sum of consecutive naturals, for example, 469618939626 + ... + 469618939675.
Almost surely, 223480946982525 is an apocalyptic number.
23480946982525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23480946982525 is a deficient number, since it is larger than the sum of its proper divisors (5635427275837).
23480946982525 is an equidigital number, since it uses as much as digits as its factorization.
23480946982525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939237879311 (or 939237879306 counting only the distinct ones).
The product of its (nonzero) digits is 298598400, while the sum is 67.
The spelling of 23480946982525 in words is "twenty-three trillion, four hundred eighty billion, nine hundred forty-six million, nine hundred eighty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •