Base | Representation |
---|---|
bin | 1100001001001000101111… |
… | …1111100001110001010110 |
3 | 1202021100112121100022022110 |
4 | 3002102023333201301112 |
5 | 3222221031400324030 |
6 | 44221225223011450 |
7 | 2545404610253445 |
oct | 302221377416126 |
9 | 52240477308273 |
10 | 13351107042390 |
11 | 4288199954407 |
12 | 15b764a899b86 |
13 | 75b008a01cc0 |
14 | 3422a890ad5c |
15 | 18245d9b31b0 |
hex | c248bfe1c56 |
13351107042390 has 64 divisors (see below), whose sum is σ = 34603598131200. Its totient is φ = 3277271923584.
The previous prime is 13351107042367. The next prime is 13351107042391. The reversal of 13351107042390 is 9324070115331.
13351107042390 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 (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13351107042391) 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, 47539110 + ... + 47819129.
It is an arithmetic number, because the mean of its divisors is an integer number (540681220800).
Almost surely, 213351107042390 is an apocalyptic number.
13351107042390 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13351107042390 is an abundant number, since it is smaller than the sum of its proper divisors (21252491088810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13351107042390 is a wasteful number, since it uses less digits than its factorization.
13351107042390 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95358621.
The product of its (nonzero) digits is 68040, while the sum is 39.
The spelling of 13351107042390 in words is "thirteen trillion, three hundred fifty-one billion, one hundred seven million, forty-two thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •