Base | Representation |
---|---|
bin | 1100001101111110110110… |
… | …1110011111001101100101 |
3 | 1202120022102000202122220102 |
4 | 3003133231232133031211 |
5 | 3230102022341340003 |
6 | 44323353344313445 |
7 | 2554412513252066 |
oct | 303375556371545 |
9 | 52508360678812 |
10 | 13434351121253 |
11 | 430a526a7a9a7 |
12 | 160b801012885 |
13 | 765b13c698ba |
14 | 34632446656d |
15 | 1846d1b8a588 |
hex | c37edb9f365 |
13434351121253 has 16 divisors (see below), whose sum is σ = 14567724495360. Its totient is φ = 12340600655616.
The previous prime is 13434351121241. The next prime is 13434351121271. The reversal of 13434351121253 is 35212115343431.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13434351121253 - 216 = 13434351055717 is a prime.
It is a super-2 number, since 2×134343511212532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13434351124253) 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, 23130926 + ... + 23704607.
It is an arithmetic number, because the mean of its divisors is an integer number (910482780960).
Almost surely, 213434351121253 is an apocalyptic number.
It is an amenable number.
13434351121253 is a deficient number, since it is larger than the sum of its proper divisors (1133373374107).
13434351121253 is a wasteful number, since it uses less digits than its factorization.
13434351121253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46835956.
The product of its digits is 129600, while the sum is 38.
Adding to 13434351121253 its reverse (35212115343431), we get a palindrome (48646466464684).
The spelling of 13434351121253 in words is "thirteen trillion, four hundred thirty-four billion, three hundred fifty-one million, one hundred twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •