Base | Representation |
---|---|
bin | 10000011100100101111… |
… | …001011011011011111111 |
3 | 11000001021102200002002110 |
4 | 100130211321123123333 |
5 | 122004133311213211 |
6 | 2223113510025103 |
7 | 144440466164463 |
oct | 20344571333377 |
9 | 4001242602073 |
10 | 1130212210431 |
11 | 3a6358367947 |
12 | 163061948193 |
13 | 8276a111375 |
14 | 3c9b9b924a3 |
15 | 1e5ed046ea6 |
hex | 10725e5b6ff |
1130212210431 has 32 divisors (see below), whose sum is σ = 1578503116800. Its totient is φ = 718435699200.
The previous prime is 1130212210243. The next prime is 1130212210453. The reversal of 1130212210431 is 1340122120311.
It is not a de Polignac number, because 1130212210431 - 229 = 1129675339519 is a prime.
It is a super-3 number, since 3×11302122104313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1130212210398 and 1130212210407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130212210031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6506395 + ... + 6677843.
It is an arithmetic number, because the mean of its divisors is an integer number (49328222400).
Almost surely, 21130212210431 is an apocalyptic number.
1130212210431 is a deficient number, since it is larger than the sum of its proper divisors (448290906369).
1130212210431 is a wasteful number, since it uses less digits than its factorization.
1130212210431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172527.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1130212210431 its reverse (1340122120311), we get a palindrome (2470334330742).
The spelling of 1130212210431 in words is "one trillion, one hundred thirty billion, two hundred twelve million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •