Base | Representation |
---|---|
bin | 11000001010000010001011… |
… | …00010111110000111000111 |
3 | 20222002100102021202120022221 |
4 | 30011001011202332013013 |
5 | 23430314432002442020 |
6 | 304551333143033211 |
7 | 14121613613340100 |
oct | 1405010542760707 |
9 | 228070367676287 |
10 | 53121322312135 |
11 | 15a20698636630 |
12 | 5b5b32743b807 |
13 | 238441c387b4c |
14 | d1912b2d53a7 |
15 | 621c1a4a56aa |
hex | 3050458be1c7 |
53121322312135 has 48 divisors (see below), whose sum is σ = 80896118791680. Its totient is φ = 33113810802240.
The previous prime is 53121322312127. The next prime is 53121322312153.
53121322312135 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 53121322312135 - 23 = 53121322312127 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53121322312135.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 127230046 + ... + 127646884.
It is an arithmetic number, because the mean of its divisors is an integer number (1685335808160).
Almost surely, 253121322312135 is an apocalyptic number.
53121322312135 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
53121322312135 is a deficient number, since it is larger than the sum of its proper divisors (27774796479545).
53121322312135 is a wasteful number, since it uses less digits than its factorization.
53121322312135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464156 (or 464149 counting only the distinct ones).
The product of its digits is 32400, while the sum is 34.
It can be divided in two parts, 5312132 and 2312135, that added together give a palindrome (7624267).
The spelling of 53121322312135 in words is "fifty-three trillion, one hundred twenty-one billion, three hundred twenty-two million, three hundred twelve thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •