Base | Representation |
---|---|
bin | 1000000011010111… |
… | …01111101100100101 |
3 | 102011021212221001112 |
4 | 10001223233230211 |
5 | 32323220241234 |
6 | 1552553234405 |
7 | 212063460551 |
oct | 40153575445 |
9 | 12137787045 |
10 | 4323212069 |
11 | 1919382240 |
12 | a07a02a05 |
13 | 53b888967 |
14 | 2d024a861 |
15 | 1a481bace |
hex | 101aefb25 |
4323212069 has 8 divisors (see below), whose sum is σ = 4793547360. Its totient is φ = 3865762800.
The previous prime is 4323212039. The next prime is 4323212071. The reversal of 4323212069 is 9602123234.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4323212069 - 216 = 4323146533 is a prime.
It is a super-2 number, since 2×43232120692 = 37380325187094521522, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4323212039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3220799 + ... + 3222140.
It is an arithmetic number, because the mean of its divisors is an integer number (599193420).
Almost surely, 24323212069 is an apocalyptic number.
It is an amenable number.
4323212069 is a deficient number, since it is larger than the sum of its proper divisors (470335291).
4323212069 is a wasteful number, since it uses less digits than its factorization.
4323212069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6443011.
The product of its (nonzero) digits is 15552, while the sum is 32.
The square root of 4323212069 is about 65751.1373970063. The cubic root of 4323212069 is about 1629.0541225791.
The spelling of 4323212069 in words is "four billion, three hundred twenty-three million, two hundred twelve thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •