Base | Representation |
---|---|
bin | 10110111101101111110010… |
… | …011010100011010100101111 |
3 | 111020121112020012101010220202 |
4 | 112331233302122203110233 |
5 | 101214241424042342033 |
6 | 554450510101104115 |
7 | 30163011452361410 |
oct | 2675576232432457 |
9 | 436545205333822 |
10 | 101000223012143 |
11 | 2a1aaa54902424 |
12 | b3b262a3b803b |
13 | 4448384695220 |
14 | 1ad2618b0b807 |
15 | ba23aa8d88e8 |
hex | 5bdbf26a352f |
101000223012143 has 16 divisors (see below), whose sum is σ = 124398504422976. Its totient is φ = 79854061593600.
The previous prime is 101000223012107. The next prime is 101000223012187. The reversal of 101000223012143 is 341210322000101.
It is not a de Polignac number, because 101000223012143 - 216 = 101000222946607 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000223017143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 404060258 + ... + 404310143.
It is an arithmetic number, because the mean of its divisors is an integer number (7774906526436).
Almost surely, 2101000223012143 is an apocalyptic number.
101000223012143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
101000223012143 is a deficient number, since it is larger than the sum of its proper divisors (23398281410833).
101000223012143 is a wasteful number, since it uses less digits than its factorization.
101000223012143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808371794.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 101000223012143 its reverse (341210322000101), we get a palindrome (442210545012244).
The spelling of 101000223012143 in words is "one hundred one trillion, two hundred twenty-three million, twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •