Base | Representation |
---|---|
bin | 1101101000110010001… |
… | …0001100101010000001 |
3 | 211101201210110101212011 |
4 | 3122030202030222001 |
5 | 12314304204241321 |
6 | 255343550132521 |
7 | 22632553134544 |
oct | 3321442145201 |
9 | 741653411764 |
10 | 234286008961 |
11 | 903a63871a4 |
12 | 394a5ab1141 |
13 | 19129645444 |
14 | b4a785085b |
15 | 61634bbae1 |
hex | 368c88ca81 |
234286008961 has 9 divisors (see below), whose sum is σ = 235864286211. Its totient is φ = 232718232552.
The previous prime is 234286008949. The next prime is 234286008967. The reversal of 234286008961 is 169800682432.
The square root of 234286008961 is 484031.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 68672823025 + 165613185936 = 262055^2 + 406956^2 .
It is a de Polignac number, because none of the positive numbers 2k-234286008961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (234286008967) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 75991326 + ... + 75994408.
Almost surely, 2234286008961 is an apocalyptic number.
234286008961 is the 484031-st square number.
234286008961 is the 242016-th centered octagonal number.
It is an amenable number.
234286008961 is a deficient number, since it is larger than the sum of its proper divisors (1578277250).
234286008961 is an frugal number, since it uses more digits than its factorization.
234286008961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6480 (or 3240 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 49.
Multiplying 234286008961 by its sum of digits (49), we get a square (11480014439089 = 33882172).
The spelling of 234286008961 in words is "two hundred thirty-four billion, two hundred eighty-six million, eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •