Base | Representation |
---|---|
bin | 10100011000110101011… |
… | …000111010101001110101 |
3 | 11221221100221021112100010 |
4 | 110120311120322221311 |
5 | 140423330044001040 |
6 | 2551345200210433 |
7 | 203136310352310 |
oct | 24306530725165 |
9 | 4857327245303 |
10 | 1401055062645 |
11 | 4a020306a497 |
12 | 1a764a609a19 |
13 | a21713828b4 |
14 | 4bb507ab977 |
15 | 266a0abae80 |
hex | 1463563aa75 |
1401055062645 has 64 divisors (see below), whose sum is σ = 2727785963520. Its totient is φ = 599439111168.
The previous prime is 1401055062587. The next prime is 1401055062647. The reversal of 1401055062645 is 5462605501041.
It is not a de Polignac number, because 1401055062645 - 29 = 1401055062133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401055062647) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1872957 + ... + 2511986.
It is an arithmetic number, because the mean of its divisors is an integer number (42621655680).
Almost surely, 21401055062645 is an apocalyptic number.
1401055062645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1401055062645 is a deficient number, since it is larger than the sum of its proper divisors (1326730900875).
1401055062645 is a wasteful number, since it uses less digits than its factorization.
1401055062645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4385154.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 1401055062645 in words is "one trillion, four hundred one billion, fifty-five million, sixty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •