Base | Representation |
---|---|
bin | 1100001111100011000101… |
… | …1101000111101001100010 |
3 | 1202122212212011100020102020 |
4 | 3003320301131013221202 |
5 | 3231022123322112004 |
6 | 44344003255402310 |
7 | 2556354334324515 |
oct | 303706135075142 |
9 | 52585764306366 |
10 | 13461257222754 |
11 | 431a98384a220 |
12 | 1614a6b983396 |
13 | 768511361c13 |
14 | 347757a24d7c |
15 | 185258d738d9 |
hex | c3e31747a62 |
13461257222754 has 64 divisors (see below), whose sum is σ = 31607461671552. Its totient is φ = 3776279731200.
The previous prime is 13461257222753. The next prime is 13461257222759. The reversal of 13461257222754 is 45722275216431.
13461257222754 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13461257222697 and 13461257222706.
It is not an unprimeable number, because it can be changed into a prime (13461257222753) 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, 98272177 + ... + 98409060.
It is an arithmetic number, because the mean of its divisors is an integer number (493866588618).
Almost surely, 213461257222754 is an apocalyptic number.
13461257222754 is an abundant number, since it is smaller than the sum of its proper divisors (18146204448798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13461257222754 is a wasteful number, since it uses less digits than its factorization.
13461257222754 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196681331.
The product of its digits is 5644800, while the sum is 51.
The spelling of 13461257222754 in words is "thirteen trillion, four hundred sixty-one billion, two hundred fifty-seven million, two hundred twenty-two thousand, seven hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •