Base | Representation |
---|---|
bin | 10100011111100110001011… |
… | …101011110101100110000101 |
3 | 102211010120001020100121202112 |
4 | 110133212023223311212011 |
5 | 43303211302422400201 |
6 | 515410101553150405 |
7 | 24661560511062161 |
oct | 2437461353654605 |
9 | 384116036317675 |
10 | 90132232231301 |
11 | 2679a957396747 |
12 | a13829225b405 |
13 | 3b3a58249a390 |
14 | 18385cd819ca1 |
15 | a6482d6770bb |
hex | 51f98baf5985 |
90132232231301 has 4 divisors (see below), whose sum is σ = 97065480864492. Its totient is φ = 83198983598112.
The previous prime is 90132232231289. The next prime is 90132232231369. The reversal of 90132232231301 is 10313223223109.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11514661342276 + 78617570889025 = 3393326^2 + 8866655^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-90132232231301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90132232231901) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3466624316576 + ... + 3466624316601.
It is an arithmetic number, because the mean of its divisors is an integer number (24266370216123).
Almost surely, 290132232231301 is an apocalyptic number.
It is an amenable number.
90132232231301 is a deficient number, since it is larger than the sum of its proper divisors (6933248633191).
90132232231301 is a wasteful number, since it uses less digits than its factorization.
90132232231301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6933248633190.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 90132232231301 in words is "ninety trillion, one hundred thirty-two billion, two hundred thirty-two million, two hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •