Base | Representation |
---|---|
bin | 11011101001100… |
… | …10101001000010 |
3 | 121011102220121012 |
4 | 31310302221002 |
5 | 433334131342 |
6 | 35003200522 |
7 | 5514323564 |
oct | 1564625102 |
9 | 534386535 |
10 | 231942722 |
11 | 109a20000 |
12 | 65816142 |
13 | 3908c61b |
14 | 22b39334 |
15 | 15568b82 |
hex | dd32a42 |
231942722 has 30 divisors (see below), whose sum is σ = 387051465. Its totient is φ = 104243920.
The previous prime is 231942721. The next prime is 231942749. The reversal of 231942722 is 227249132.
It can be written as a sum of positive squares in 2 ways, for example, as 207331201 + 24611521 = 14399^2 + 4961^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=10769.
It is a Duffinian number.
Its product of digits (12096) is a multiple of the sum of its prime factors (224).
It is not an unprimeable number, because it can be changed into a prime (231942721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 2606054 + ... + 2606142.
Almost surely, 2231942722 is an apocalyptic number.
231942722 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
231942722 is a deficient number, since it is larger than the sum of its proper divisors (155108743).
231942722 is an frugal number, since it uses more digits than its factorization.
231942722 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224 (or 102 counting only the distinct ones).
The product of its digits is 12096, while the sum is 32.
The square root of 231942722 is about 15229.6658531959. The cubic root of 231942722 is about 614.4127931121.
Multiplying 231942722 by its sum of digits (32), we get a square (7422167104 = 861522).
The spelling of 231942722 in words is "two hundred thirty-one million, nine hundred forty-two thousand, seven hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •