Base | Representation |
---|---|
bin | 10001101001111010001… |
… | …110010001101101111111 |
3 | 11021222120011210211211110 |
4 | 101221322032101231333 |
5 | 124334144210343130 |
6 | 2325203434053103 |
7 | 153440001145353 |
oct | 21517216215577 |
9 | 4258504724743 |
10 | 1213231340415 |
11 | 42858a50aa76 |
12 | 17717087a193 |
13 | 8a53a897b13 |
14 | 42a138b3463 |
15 | 2185b5d7ab0 |
hex | 11a7a391b7f |
1213231340415 has 16 divisors (see below), whose sum is σ = 1941335899776. Its totient is φ = 647001463200.
The previous prime is 1213231340407. The next prime is 1213231340417. The reversal of 1213231340415 is 5140431323121.
It is not a de Polignac number, because 1213231340415 - 23 = 1213231340407 is a prime.
It is a super-3 number, since 3×12132313404153 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213231340417) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3271401 + ... + 3623330.
It is an arithmetic number, because the mean of its divisors is an integer number (121333493736).
Almost surely, 21213231340415 is an apocalyptic number.
1213231340415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1213231340415 is a deficient number, since it is larger than the sum of its proper divisors (728104559361).
1213231340415 is a wasteful number, since it uses less digits than its factorization.
1213231340415 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6906470.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 1213231340415 its reverse (5140431323121), we get a palindrome (6353662663536).
The spelling of 1213231340415 in words is "one trillion, two hundred thirteen billion, two hundred thirty-one million, three hundred forty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •