Base | Representation |
---|---|
bin | 10100011001000000100… |
… | …011100110010001000101 |
3 | 11221221211222210212110212 |
4 | 110121000203212101011 |
5 | 140424221024141401 |
6 | 2551415531525205 |
7 | 203144043660530 |
oct | 24310043462105 |
9 | 4857758725425 |
10 | 1401242412101 |
11 | 4a02998a1954 |
12 | 1a76a12b9805 |
13 | a21a112aa6c |
14 | 4bb6b619a17 |
15 | 266b2276dbb |
hex | 146408e6445 |
1401242412101 has 8 divisors (see below), whose sum is σ = 1601458166784. Its totient is φ = 1201036224240.
The previous prime is 1401242412083. The next prime is 1401242412107. The reversal of 1401242412101 is 1012142421041.
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 1401242412101 - 214 = 1401242395717 is a prime.
It is a super-2 number, since 2×14012424121012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401242412107) 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, 2075045 + ... + 2666138.
It is an arithmetic number, because the mean of its divisors is an integer number (200182270848).
Almost surely, 21401242412101 is an apocalyptic number.
It is an amenable number.
1401242412101 is a deficient number, since it is larger than the sum of its proper divisors (200215754683).
1401242412101 is an equidigital number, since it uses as much as digits as its factorization.
1401242412101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4783411.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 1401242412101 its reverse (1012142421041), we get a palindrome (2413384833142).
The spelling of 1401242412101 in words is "one trillion, four hundred one billion, two hundred forty-two million, four hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •