Search a number
-
+
10401455341131 = 328579121318163
BaseRepresentation
bin1001011101011100011100…
…0011001111111001001011
31100211100222022021121112120
42113113013003033321023
52330404140031404011
634042210154142323
72122323521422341
oct227270703177113
940740868247476
1010401455341131
113350261413788
1211bba564219a3
135a5b1215085a
1427d60c6cb991
151308744b3a06
hex975c70cfe4b

10401455341131 has 8 divisors (see below), whose sum is σ = 13869092508480. Its totient is φ = 6934060867272.

The previous prime is 10401455341093. The next prime is 10401455341159. The reversal of 10401455341131 is 13114355410401.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10401455341131 - 217 = 10401455210059 is a prime.

It is a super-2 number, since 2×104014553411312 (a number of 27 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 10401455341092 and 10401455341101.

It is not an unprimeable number, because it can be changed into a prime (10401455346131) 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, 60573345 + ... + 60744818.

It is an arithmetic number, because the mean of its divisors is an integer number (1733636563560).

Almost surely, 210401455341131 is an apocalyptic number.

10401455341131 is a deficient number, since it is larger than the sum of its proper divisors (3467637167349).

10401455341131 is a wasteful number, since it uses less digits than its factorization.

10401455341131 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 121346745.

The product of its (nonzero) digits is 14400, while the sum is 33.

The spelling of 10401455341131 in words is "ten trillion, four hundred one billion, four hundred fifty-five million, three hundred forty-one thousand, one hundred thirty-one".

Divisors: 1 3 28579 85737 121318163 363954489 3467151780377 10401455341131