Base | Representation |
---|---|
bin | 1111101100001110… |
… | …1000001011011111 |
3 | 101212112200101222110 |
4 | 3323003220023133 |
5 | 32111240012343 |
6 | 1533542245103 |
7 | 206243453220 |
oct | 37303501337 |
9 | 11775611873 |
10 | 4212032223 |
11 | 1871645173 |
12 | 996726793 |
13 | 52182c579 |
14 | 2bd589247 |
15 | 199ba9833 |
hex | fb0e82df |
4212032223 has 16 divisors (see below), whose sum is σ = 6419479040. Its totient is φ = 2406446496.
The previous prime is 4212032219. The next prime is 4212032269. The reversal of 4212032223 is 3222302124.
It is not a de Polignac number, because 4212032223 - 22 = 4212032219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4212032223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4212032023) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 131913 + ... + 160701.
It is an arithmetic number, because the mean of its divisors is an integer number (401217440).
Almost surely, 24212032223 is an apocalyptic number.
4212032223 is a deficient number, since it is larger than the sum of its proper divisors (2207446817).
4212032223 is a wasteful number, since it uses less digits than its factorization.
4212032223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35766.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 4212032223 is about 64900.1712093273. The cubic root of 4212032223 is about 1614.9679019267.
Adding to 4212032223 its reverse (3222302124), we get a palindrome (7434334347).
The spelling of 4212032223 in words is "four billion, two hundred twelve million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •