Base | Representation |
---|---|
bin | 1011001111000000010001… |
… | …1011110100100110111011 |
3 | 1121201212201000111111012202 |
4 | 2303300010123310212323 |
5 | 3104340203442024111 |
6 | 42134340412300415 |
7 | 2413300665353501 |
oct | 263600433644673 |
9 | 47655630444182 |
10 | 12352400345531 |
11 | 3a32694a72294 |
12 | 1475b89a7170b |
13 | 6b7a986681bc |
14 | 309c06160671 |
15 | 1664aaa67b3b |
hex | b3c046f49bb |
12352400345531 has 8 divisors (see below), whose sum is σ = 12419515319760. Its totient is φ = 12285396767488.
The previous prime is 12352400345521. The next prime is 12352400345543. The reversal of 12352400345531 is 13554300425321.
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 12352400345531 - 238 = 12077522438587 is a prime.
It is a super-2 number, since 2×123524003455312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12352400345521) 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, 27626666 + ... + 28070223.
It is an arithmetic number, because the mean of its divisors is an integer number (1552439414970).
Almost surely, 212352400345531 is an apocalyptic number.
12352400345531 is a deficient number, since it is larger than the sum of its proper divisors (67114974229).
12352400345531 is an equidigital number, since it uses as much as digits as its factorization.
12352400345531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55698093.
The product of its (nonzero) digits is 216000, while the sum is 38.
The spelling of 12352400345531 in words is "twelve trillion, three hundred fifty-two billion, four hundred million, three hundred forty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •