Base | Representation |
---|---|
bin | 110100101001110111111101… |
… | …1111111001101011010110101 |
3 | 2020201212220100000200200002121 |
4 | 1221103233323333031122311 |
5 | 441201240322124443123 |
6 | 4321013034202035541 |
7 | 166361425652062660 |
oct | 15123577377153265 |
9 | 2221786300620077 |
10 | 463152026015413 |
11 | 124635742378a29 |
12 | 43b41b704a8bb1 |
13 | 16b58082b61077 |
14 | 825296b7366d7 |
15 | 38829a8d0575d |
hex | 1a53bfbfcd6b5 |
463152026015413 has 32 divisors (see below), whose sum is σ = 537194158797312. Its totient is φ = 391092105600000.
The previous prime is 463152026015401. The next prime is 463152026015453. The reversal of 463152026015413 is 314510620251364.
It is not a de Polignac number, because 463152026015413 - 213 = 463152026007221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 463152026015413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (463152026015453) 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, 3516627463 + ... + 3516759163.
It is an arithmetic number, because the mean of its divisors is an integer number (16787317462416).
Almost surely, 2463152026015413 is an apocalyptic number.
It is an amenable number.
463152026015413 is a deficient number, since it is larger than the sum of its proper divisors (74042132781899).
463152026015413 is a wasteful number, since it uses less digits than its factorization.
463152026015413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139765.
The product of its (nonzero) digits is 518400, while the sum is 43.
Adding to 463152026015413 its reverse (314510620251364), we get a palindrome (777662646266777).
The spelling of 463152026015413 in words is "four hundred sixty-three trillion, one hundred fifty-two billion, twenty-six million, fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •