Base | Representation |
---|---|
bin | 110100100011100100110011… |
… | …100100001110000000100011 |
3 | 1010022102001210110110200210021 |
4 | 310203210303210032000203 |
5 | 220244022102221221121 |
6 | 2135333403343414311 |
7 | 66454352664400660 |
oct | 6443446344160043 |
9 | 1108361713420707 |
10 | 231143120101411 |
11 | 67716279454841 |
12 | 21b111032b4397 |
13 | 9bc8919aa12ab |
14 | 411155b192a67 |
15 | 1bac86a1ba641 |
hex | d2393390e023 |
231143120101411 has 8 divisors (see below), whose sum is σ = 264169466252384. Its totient is φ = 198118249056000.
The previous prime is 231143120101393. The next prime is 231143120101417. The reversal of 231143120101411 is 114101021341132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231143120101411 - 233 = 231134530166819 is a prime.
It is a super-3 number, since 3×2311431201014113 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (231143120101417) 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, 368440590 + ... + 369067411.
It is an arithmetic number, because the mean of its divisors is an integer number (33021183281548).
Almost surely, 2231143120101411 is an apocalyptic number.
231143120101411 is a deficient number, since it is larger than the sum of its proper divisors (33026346150973).
231143120101411 is an equidigital number, since it uses as much as digits as its factorization.
231143120101411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 737552781.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 231143120101411 its reverse (114101021341132), we get a palindrome (345244141442543).
The spelling of 231143120101411 in words is "two hundred thirty-one trillion, one hundred forty-three billion, one hundred twenty million, one hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •