Base | Representation |
---|---|
bin | 10001111101011101111… |
… | …000001101101100100001 |
3 | 11100222202122200100100001 |
4 | 101331131320031230201 |
5 | 130210201020144301 |
6 | 2342555301500001 |
7 | 155112246160441 |
oct | 21753570155441 |
9 | 4328678610301 |
10 | 1234230631201 |
11 | 436486018a47 |
12 | 17b251411601 |
13 | 8c5062c1b79 |
14 | 43a467a0121 |
15 | 22189e44c01 |
hex | 11f5de0db21 |
1234230631201 has 8 divisors (see below), whose sum is σ = 1243387910240. Its totient is φ = 1225077322752.
The previous prime is 1234230631187. The next prime is 1234230631241. The reversal of 1234230631201 is 1021360324321.
It is a happy number.
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 1234230631201 - 25 = 1234230631169 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1234230631201.
It is not an unprimeable number, because it can be changed into a prime (1234230631241) 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, 367200 + ... + 1613473.
It is an arithmetic number, because the mean of its divisors is an integer number (155423488780).
Almost surely, 21234230631201 is an apocalyptic number.
It is an amenable number.
1234230631201 is a deficient number, since it is larger than the sum of its proper divisors (9157279039).
1234230631201 is a wasteful number, since it uses less digits than its factorization.
1234230631201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1985295.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 1234230631201 its reverse (1021360324321), we get a palindrome (2255590955522).
The spelling of 1234230631201 in words is "one trillion, two hundred thirty-four billion, two hundred thirty million, six hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •