Base | Representation |
---|---|
bin | 101111001011011101101… |
… | …110010000010011101111 |
3 | 102110221111021121102202222 |
4 | 233023131232100103233 |
5 | 411104333024400333 |
6 | 10521224535305555 |
7 | 453143612523455 |
oct | 57133556202357 |
9 | 12427437542688 |
10 | 3242125231343 |
11 | 103aa83197759 |
12 | 44441921b2bb |
13 | 1a69672b4a6b |
14 | b2cc391c9d5 |
15 | 5950604d298 |
hex | 2f2ddb904ef |
3242125231343 has 8 divisors (see below), whose sum is σ = 3256392024000. Its totient is φ = 3227864284288.
The previous prime is 3242125231333. The next prime is 3242125231357. The reversal of 3242125231343 is 3431325212423.
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 3242125231343 - 224 = 3242108454127 is a prime.
It is a super-2 number, since 2×32421252313432 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3242125231333) 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, 347846 + ... + 2570067.
It is an arithmetic number, because the mean of its divisors is an integer number (407049003000).
Almost surely, 23242125231343 is an apocalyptic number.
3242125231343 is a deficient number, since it is larger than the sum of its proper divisors (14266792657).
3242125231343 is a wasteful number, since it uses less digits than its factorization.
3242125231343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2922801.
The product of its digits is 103680, while the sum is 35.
It can be divided in two parts, 324212 and 5231343, that added together give a palindrome (5555555).
The spelling of 3242125231343 in words is "three trillion, two hundred forty-two billion, one hundred twenty-five million, two hundred thirty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •