Search a number
-
+
1406141625553 = 71971019682107
BaseRepresentation
bin10100011101100100100…
…100100111010011010001
311222102111102112200212221
4110131210210213103101
5141014234224004203
62553550023021041
7203406333415630
oct24354444472321
94872442480787
101406141625553
114a2383320495
121a8629b9a781
13a27a212bb32
144c0b4163517
152689c420abd
hex147649274d1

1406141625553 has 8 divisors (see below), whose sum is σ = 1615176459072. Its totient is φ = 1199146156656.

The previous prime is 1406141625541. The next prime is 1406141625571. The reversal of 1406141625553 is 3555261416041.

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

It is not a de Polignac number, because 1406141625553 - 217 = 1406141494481 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1406141625503) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 509839675 + ... + 509842432.

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

Almost surely, 21406141625553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1019682311.

The product of its (nonzero) digits is 432000, while the sum is 43.

The spelling of 1406141625553 in words is "one trillion, four hundred six billion, one hundred forty-one million, six hundred twenty-five thousand, five hundred fifty-three".

Divisors: 1 7 197 1379 1019682107 7137774749 200877375079 1406141625553