Base | Representation |
---|---|
bin | 1100011010010100000… |
… | …1111000001000101111 |
3 | 202101100211001111100012 |
4 | 3012211001320020233 |
5 | 11443134331131343 |
6 | 241541454123435 |
7 | 21255562126424 |
oct | 3064501701057 |
9 | 671324044305 |
10 | 213222130223 |
11 | 82477374353 |
12 | 353a77b057b |
13 | 1715072607b |
14 | a46a14dd4b |
15 | 582e152718 |
hex | 31a507822f |
213222130223 has 32 divisors (see below), whose sum is σ = 232095559680. Its totient is φ = 195292500480.
The previous prime is 213222130217. The next prime is 213222130259. The reversal of 213222130223 is 322031222312.
It is not a de Polignac number, because 213222130223 - 26 = 213222130159 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213222130273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 113596361 + ... + 113598237.
It is an arithmetic number, because the mean of its divisors is an integer number (7252986240).
Almost surely, 2213222130223 is an apocalyptic number.
213222130223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
213222130223 is a deficient number, since it is larger than the sum of its proper divisors (18873429457).
213222130223 is a wasteful number, since it uses less digits than its factorization.
213222130223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3527.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 213222130223 its reverse (322031222312), we get a palindrome (535253352535).
The spelling of 213222130223 in words is "two hundred thirteen billion, two hundred twenty-two million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •