Base | Representation |
---|---|
bin | 100001111010000100110… |
… | …011000001101111101000 |
3 | 22020202101200200200020000 |
4 | 201322010303001233220 |
5 | 301134021130242212 |
6 | 4542233330503000 |
7 | 330226025164233 |
oct | 41720463015750 |
9 | 8222350620200 |
10 | 2330100243432 |
11 | 81920a929525 |
12 | 317709a34a60 |
13 | 13b95c4555c0 |
14 | 80ac549241a |
15 | 40927eb71dc |
hex | 21e84cc1be8 |
2330100243432 has 80 divisors (see below), whose sum is σ = 7028471913540. Its totient is φ = 716953918464.
The previous prime is 2330100243421. The next prime is 2330100243463. The reversal of 2330100243432 is 2343420010332.
It can be written as a sum of positive squares in 2 ways, for example, as 2183201284356 + 146898959076 = 1477566^2 + 383274^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2330100243396 and 2330100243405.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 138292873 + ... + 138309720.
Almost surely, 22330100243432 is an apocalyptic number.
It is an amenable number.
2330100243432 is an abundant number, since it is smaller than the sum of its proper divisors (4698371670108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2330100243432 is a wasteful number, since it uses less digits than its factorization.
2330100243432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276602624 (or 276602611 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 2330100243432 its reverse (2343420010332), we get a palindrome (4673520253764).
The spelling of 2330100243432 in words is "two trillion, three hundred thirty billion, one hundred million, two hundred forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •