Base | Representation |
---|---|
bin | 1100001100100110000000… |
… | …0101111000000000111001 |
3 | 1202111000211210202202102010 |
4 | 3003021200011320000321 |
5 | 3224204201003113001 |
6 | 44304410525200133 |
7 | 2552606456433114 |
oct | 303114005700071 |
9 | 52430753682363 |
10 | 13410500051001 |
11 | 43003a7738899 |
12 | 1607065400049 |
13 | 7637b2786291 |
14 | 34510091757b |
15 | 183c87cb68d6 |
hex | c3260178039 |
13410500051001 has 8 divisors (see below), whose sum is σ = 17882780072704. Its totient is φ = 8939276698320.
The previous prime is 13410500050979. The next prime is 13410500051027. The reversal of 13410500051001 is 10015000501431.
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 13410500051001 - 213 = 13410500042809 is a prime.
It is a super-2 number, since 2×134105000510012 (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 (13410500051051) 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, 264137641 + ... + 264188406.
It is an arithmetic number, because the mean of its divisors is an integer number (2235347509088).
Almost surely, 213410500051001 is an apocalyptic number.
It is an amenable number.
13410500051001 is a deficient number, since it is larger than the sum of its proper divisors (4472280021703).
13410500051001 is an equidigital number, since it uses as much as digits as its factorization.
13410500051001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 528334511.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 13410500051001 its reverse (10015000501431), we get a palindrome (23425500552432).
The spelling of 13410500051001 in words is "thirteen trillion, four hundred ten billion, five hundred million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •