Base | Representation |
---|---|
bin | 11111111011000110110110… |
… | …000011011101111010010001 |
3 | 200102010020010211122201222112 |
4 | 133323012312003131322101 |
5 | 121400313220004114301 |
6 | 1214335234523115105 |
7 | 41400440422416425 |
oct | 3773066603357221 |
9 | 612106124581875 |
10 | 140401240301201 |
11 | 40810916996260 |
12 | 138b684b372a95 |
13 | 6045a1acb3b79 |
14 | 26956560b0b85 |
15 | 1137259c319bb |
hex | 7fb1b60dde91 |
140401240301201 has 16 divisors (see below), whose sum is σ = 153261623021568. Its totient is φ = 127556973936000.
The previous prime is 140401240301183. The next prime is 140401240301243. The reversal of 140401240301201 is 102103042104041.
It is a cyclic number.
It is not a de Polignac number, because 140401240301201 - 214 = 140401240284817 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140401240301251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268514651 + ... + 269037023.
It is an arithmetic number, because the mean of its divisors is an integer number (9578851438848).
Almost surely, 2140401240301201 is an apocalyptic number.
140401240301201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140401240301201 is a deficient number, since it is larger than the sum of its proper divisors (12860382720367).
140401240301201 is a wasteful number, since it uses less digits than its factorization.
140401240301201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 537752.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 140401240301201 its reverse (102103042104041), we get a palindrome (242504282405242).
The spelling of 140401240301201 in words is "one hundred forty trillion, four hundred one billion, two hundred forty million, three hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •