Base | Representation |
---|---|
bin | 101111000010110000… |
… | …0100001011101111111 |
3 | 100122202112202012122111 |
4 | 1132011200201131333 |
5 | 3123344140040411 |
6 | 114224305554451 |
7 | 10204321022554 |
oct | 1360540413577 |
9 | 318675665574 |
10 | 101024143231 |
11 | 3993154a070 |
12 | 176b4945a27 |
13 | 96aca50b5b |
14 | 4c65094a2b |
15 | 29640d9721 |
hex | 178582177f |
101024143231 has 4 divisors (see below), whose sum is σ = 110208156264. Its totient is φ = 91840130200.
The previous prime is 101024143223. The next prime is 101024143273. The reversal of 101024143231 is 132341420101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101024143231 - 23 = 101024143223 is a prime.
It is a super-2 number, since 2×1010241432312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101024153231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4592006500 + ... + 4592006521.
It is an arithmetic number, because the mean of its divisors is an integer number (27552039066).
Almost surely, 2101024143231 is an apocalyptic number.
101024143231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101024143231 is a deficient number, since it is larger than the sum of its proper divisors (9184013033).
101024143231 is an equidigital number, since it uses as much as digits as its factorization.
101024143231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9184013032.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 101024143231 its reverse (132341420101), we get a palindrome (233365563332).
The spelling of 101024143231 in words is "one hundred one billion, twenty-four million, one hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •