Base | Representation |
---|---|
bin | 110100010100100011101010… |
… | …011100100010011010000001 |
3 | 1010011202101222021211112211211 |
4 | 310110203222130202122001 |
5 | 220130120013401400001 |
6 | 2133223325221010121 |
7 | 66316656413436100 |
oct | 6424435234423201 |
9 | 1104671867745754 |
10 | 230111101200001 |
11 | 6735862a70935a |
12 | 219850a6253941 |
13 | 9b524cb0a8c58 |
14 | 40b7618526037 |
15 | 1b90ab7982351 |
hex | d148ea722681 |
230111101200001 has 12 divisors (see below), whose sum is σ = 267681721102848. Its totient is φ = 197237010567912.
The previous prime is 230111101199963. The next prime is 230111101200053. The reversal of 230111101200001 is 100002101111032.
It is a happy number.
It is not a de Polignac number, because 230111101200001 - 29 = 230111101199489 is a prime.
It is a super-2 number, since 2×2301111012000012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230111101200091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3673561 + ... + 21765046.
It is an arithmetic number, because the mean of its divisors is an integer number (22306810091904).
Almost surely, 2230111101200001 is an apocalyptic number.
It is an amenable number.
230111101200001 is a deficient number, since it is larger than the sum of its proper divisors (37570619902847).
230111101200001 is a wasteful number, since it uses less digits than its factorization.
230111101200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25623228 (or 25623221 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 230111101200001 its reverse (100002101111032), we get a palindrome (330113202311033).
The spelling of 230111101200001 in words is "two hundred thirty trillion, one hundred eleven billion, one hundred one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •