Base | Representation |
---|---|
bin | 1001100101101001001000… |
… | …0110110011011000011011 |
3 | 1101022211112002020110212122 |
4 | 2121122102012303120123 |
5 | 2340211113024014433 |
6 | 34231022145331455 |
7 | 2135441021656124 |
oct | 231322206633033 |
9 | 41284462213778 |
10 | 10542301001243 |
11 | 33a4a68094880 |
12 | 1223203336b8b |
13 | 5b6199c9163b |
14 | 28637036d04b |
15 | 13436957b198 |
hex | 996921b361b |
10542301001243 has 8 divisors (see below), whose sum is σ = 11646270382080. Its totient is φ = 9462594683880.
The previous prime is 10542301001207. The next prime is 10542301001329. The reversal of 10542301001243 is 34210010324501.
It is a happy number.
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 10542301001243 - 212 = 10542300997147 is a prime.
It is a super-2 number, since 2×105423010012432 (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 (10542301001143) 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, 6065764955 + ... + 6065766692.
It is an arithmetic number, because the mean of its divisors is an integer number (1455783797760).
Almost surely, 210542301001243 is an apocalyptic number.
10542301001243 is a deficient number, since it is larger than the sum of its proper divisors (1103969380837).
10542301001243 is a wasteful number, since it uses less digits than its factorization.
10542301001243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12131531737.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 10542301001243 its reverse (34210010324501), we get a palindrome (44752311325744).
The spelling of 10542301001243 in words is "ten trillion, five hundred forty-two billion, three hundred one million, one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •