Base | Representation |
---|---|
bin | 1100011001111111000… |
… | …1101100001110010001 |
3 | 202101010200020001211102 |
4 | 3012133301230032101 |
5 | 11442444301013131 |
6 | 241525025154145 |
7 | 21253442055143 |
oct | 3063761541621 |
9 | 671120201742 |
10 | 213134001041 |
11 | 82431650615 |
12 | 3538218b955 |
13 | 171383aa820 |
14 | a45c56cc93 |
15 | 58265451cb |
hex | 319fc6c391 |
213134001041 has 8 divisors (see below), whose sum is σ = 229532678760. Its totient is φ = 196735859712.
The previous prime is 213134001023. The next prime is 213134001053. The reversal of 213134001041 is 140100431312.
It can be written as a sum of positive squares in 4 ways, for example, as 16822090000 + 196311911041 = 129700^2 + 443071^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213134001041 - 230 = 212060259217 is a prime.
It is a super-2 number, since 2×2131340010412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213134001061) 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, 1138595 + ... + 1312503.
It is an arithmetic number, because the mean of its divisors is an integer number (28691584845).
Almost surely, 2213134001041 is an apocalyptic number.
It is an amenable number.
213134001041 is a deficient number, since it is larger than the sum of its proper divisors (16398677719).
213134001041 is a wasteful number, since it uses less digits than its factorization.
213134001041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268195.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 213134001041 its reverse (140100431312), we get a palindrome (353234432353).
The spelling of 213134001041 in words is "two hundred thirteen billion, one hundred thirty-four million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •