Base | Representation |
---|---|
bin | 1001010001110011101101… |
… | …1101111111010101011111 |
3 | 1100010020222012210101002101 |
4 | 2110130323131333111133 |
5 | 2314120231012422333 |
6 | 33410305230505531 |
7 | 2102015540066551 |
oct | 224347335772537 |
9 | 40106865711071 |
10 | 10201545045343 |
11 | 32834a62516a3 |
12 | 11891649652a7 |
13 | 5900035abac2 |
14 | 273a864bb4d1 |
15 | 12a573d5d67d |
hex | 9473b77f55f |
10201545045343 has 8 divisors (see below), whose sum is σ = 10348602076800. Its totient is φ = 10054581716760.
The previous prime is 10201545045233. The next prime is 10201545045361. The reversal of 10201545045343 is 34354054510201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201545045343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201545145343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23206393 + ... + 23641906.
It is an arithmetic number, because the mean of its divisors is an integer number (1293575259600).
Almost surely, 210201545045343 is an apocalyptic number.
10201545045343 is a deficient number, since it is larger than the sum of its proper divisors (147057031457).
10201545045343 is an equidigital number, since it uses as much as digits as its factorization.
10201545045343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46851437.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 10201545045343 its reverse (34354054510201), we get a palindrome (44555599555544).
The spelling of 10201545045343 in words is "ten trillion, two hundred one billion, five hundred forty-five million, forty-five thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •