Base | Representation |
---|---|
bin | 11000010110000011… |
… | …11111101100001101 |
3 | 1020201212110111010200 |
4 | 30023001333230031 |
5 | 203231403134120 |
6 | 10000530524113 |
7 | 641612643204 |
oct | 141301775415 |
9 | 36655414120 |
10 | 13069974285 |
11 | 55a7729145 |
12 | 2649136639 |
13 | 1303a318c4 |
14 | 8bdb8223b |
15 | 517674e90 |
hex | 30b07fb0d |
13069974285 has 24 divisors (see below), whose sum is σ = 22738861080. Its totient is φ = 6944733312.
The previous prime is 13069974251. The next prime is 13069974293. The reversal of 13069974285 is 58247996031.
It can be written as a sum of positive squares in 4 ways, for example, as 2350892196 + 10719082089 = 48486^2 + 103533^2 .
It is not a de Polignac number, because 13069974285 - 27 = 13069974157 is a prime.
It is a super-2 number, since 2×130699742852 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 527754 + ... + 551963.
It is an arithmetic number, because the mean of its divisors is an integer number (947452545).
It is a 2-persistent number, because it is pandigital, and so is 2⋅13069974285 = 26139948570, but 3⋅13069974285 = 39209922855 is not.
Almost surely, 213069974285 is an apocalyptic number.
13069974285 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13069974285 is a deficient number, since it is larger than the sum of its proper divisors (9668886795).
13069974285 is a wasteful number, since it uses less digits than its factorization.
13069974285 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1079997 (or 1079994 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 13069974285 in words is "thirteen billion, sixty-nine million, nine hundred seventy-four thousand, two hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •