Base | Representation |
---|---|
bin | 1010100011110110110001… |
… | …11101100100110001011000 |
3 | 10001020000122100202011211112 |
4 | 11101323120331210301120 |
5 | 11020433113201102412 |
6 | 121220051402515452 |
7 | 4614515405344622 |
oct | 521733075446130 |
9 | 101200570664745 |
10 | 23222233222232 |
11 | 7443548284940 |
12 | 273075ab05b88 |
13 | cc5b023a18b5 |
14 | 5a3d67d65c12 |
15 | 2a40e489a722 |
hex | 151ed8f64c58 |
23222233222232 has 32 divisors (see below), whose sum is σ = 47574125614800. Its totient is φ = 10539093196800.
The previous prime is 23222233222231. The next prime is 23222233222241.
23222233222232 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23222233222231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205785257 + ... + 205898072.
Almost surely, 223222233222232 is an apocalyptic number.
23222233222232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23222233222232 is an abundant number, since it is smaller than the sum of its proper divisors (24351892392568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23222233222232 is a wasteful number, since it uses less digits than its factorization.
23222233222232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411683987 (or 411683983 counting only the distinct ones).
The product of its digits is 82944, while the sum is 32.
It can be divided in two parts, 2322223 and 3222232, that added together give a palindrome (5544455).
The spelling of 23222233222232 in words is "twenty-three trillion, two hundred twenty-two billion, two hundred thirty-three million, two hundred twenty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •