Base | Representation |
---|---|
bin | 1101011110000111001… |
… | …1011000011111110001 |
3 | 211010100011120212010121 |
4 | 3113201303120133301 |
5 | 12242422413004334 |
6 | 254151424130241 |
7 | 22501562141224 |
oct | 3274163303761 |
9 | 733304525117 |
10 | 231421609969 |
11 | 8a166513900 |
12 | 38a26766981 |
13 | 18a9108abb4 |
14 | b2b52655bb |
15 | 6046cb0db4 |
hex | 35e1cd87f1 |
231421609969 has 27 divisors (see below), whose sum is σ = 257510698977. Its totient is φ = 207819216000.
The previous prime is 231421609961. The next prime is 231421609987. The reversal of 231421609969 is 969906124132.
The square root of 231421609969 is 481063.
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 4643741025 + 226777868944 = 68145^2 + 476212^2 .
It is not a de Polignac number, because 231421609969 - 23 = 231421609961 is a prime.
It is a super-2 number, since 2×2314216099692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231421609961) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 534460777 + ... + 534461209.
Almost surely, 2231421609969 is an apocalyptic number.
231421609969 is the 481063-rd square number.
231421609969 is the 240532-nd centered octagonal number.
It is an amenable number.
231421609969 is a deficient number, since it is larger than the sum of its proper divisors (26089089008).
231421609969 is an frugal number, since it uses more digits than its factorization.
231421609969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1090 (or 545 counting only the distinct ones).
The product of its (nonzero) digits is 1259712, while the sum is 52.
The spelling of 231421609969 in words is "two hundred thirty-one billion, four hundred twenty-one million, six hundred nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •