Base | Representation |
---|---|
bin | 10001111011101101010… |
… | …001001001110010110100 |
3 | 11100210212222122120201020 |
4 | 101323231101021302310 |
5 | 130142313340442122 |
6 | 2342044011501140 |
7 | 155014365404664 |
oct | 21735521116264 |
9 | 4323788576636 |
10 | 1232341343412 |
11 | 4356a661a083 |
12 | 17aa047577b0 |
13 | 8c294a6c0ba |
14 | 439078c41a4 |
15 | 220c9150c5c |
hex | 11eed449cb4 |
1232341343412 has 24 divisors (see below), whose sum is σ = 2875494627936. Its totient is φ = 410775948768.
The previous prime is 1232341343411. The next prime is 1232341343447. The reversal of 1232341343412 is 2143431432321.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1232341343411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 690583 + ... + 1715105.
It is an arithmetic number, because the mean of its divisors is an integer number (119812276164).
Almost surely, 21232341343412 is an apocalyptic number.
1232341343412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1232341343412 is an abundant number, since it is smaller than the sum of its proper divisors (1643153284524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1232341343412 is a wasteful number, since it uses less digits than its factorization.
1232341343412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1124767 (or 1124765 counting only the distinct ones).
The product of its digits is 41472, while the sum is 33.
Adding to 1232341343412 its reverse (2143431432321), we get a palindrome (3375772775733).
The spelling of 1232341343412 in words is "one trillion, two hundred thirty-two billion, three hundred forty-one million, three hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •