Base | Representation |
---|---|
bin | 10000011110100100111… |
… | …010101000001101101111 |
3 | 11000020202221120011012220 |
4 | 100132210322220031233 |
5 | 122023014331400333 |
6 | 2224105153130423 |
7 | 144544343441442 |
oct | 20364472501557 |
9 | 4006687504186 |
10 | 1132343231343 |
11 | 3a7251263455 |
12 | 163557559a13 |
13 | 82a19770a9c |
14 | 3cb3cbd5659 |
15 | 1e6c518a8b3 |
hex | 107a4ea836f |
1132343231343 has 8 divisors (see below), whose sum is σ = 1509815388288. Its totient is φ = 754883280984.
The previous prime is 1132343231339. The next prime is 1132343231353. The reversal of 1132343231343 is 3431323432311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1132343231343 - 22 = 1132343231339 is a prime.
It is a super-4 number, since 4×11323432313434 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132343231303) 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, 2832955 + ... + 3207852.
It is an arithmetic number, because the mean of its divisors is an integer number (188726923536).
Almost surely, 21132343231343 is an apocalyptic number.
1132343231343 is a deficient number, since it is larger than the sum of its proper divisors (377472156945).
1132343231343 is an equidigital number, since it uses as much as digits as its factorization.
1132343231343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6103293.
The product of its digits is 46656, while the sum is 33.
Adding to 1132343231343 its reverse (3431323432311), we get a palindrome (4563666663654).
The spelling of 1132343231343 in words is "one trillion, one hundred thirty-two billion, three hundred forty-three million, two hundred thirty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •