Base | Representation |
---|---|
bin | 10100011000110100001… |
… | …101010110100111011101 |
3 | 11221221022120000011022101 |
4 | 110120310031112213131 |
5 | 140423310011113422 |
6 | 2551343211445101 |
7 | 203135650111663 |
oct | 24306415264735 |
9 | 4857276004271 |
10 | 1401035254237 |
11 | 4a01a2970103 |
12 | 1a7643a56791 |
13 | a216a238748 |
14 | 4bb4bcd2c33 |
15 | 2669dea6c27 |
hex | 146343569dd |
1401035254237 has 8 divisors (see below), whose sum is σ = 1401475714560. Its totient is φ = 1400594872560.
The previous prime is 1401035254207. The next prime is 1401035254259. The reversal of 1401035254237 is 7324525301041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1401035254237 - 211 = 1401035252189 is a prime.
It is a super-2 number, since 2×14010352542372 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1401035254196 and 1401035254205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401035254207) 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, 62138188 + ... + 62160730.
It is an arithmetic number, because the mean of its divisors is an integer number (175184464320).
Almost surely, 21401035254237 is an apocalyptic number.
It is an amenable number.
1401035254237 is a deficient number, since it is larger than the sum of its proper divisors (440460323).
1401035254237 is a wasteful number, since it uses less digits than its factorization.
1401035254237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39323.
The product of its (nonzero) digits is 100800, while the sum is 37.
The spelling of 1401035254237 in words is "one trillion, four hundred one billion, thirty-five million, two hundred fifty-four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •