Base | Representation |
---|---|
bin | 11000110111000000… |
… | …11111110011000010 |
3 | 1021110010121122120102 |
4 | 30123200133303002 |
5 | 204313134434240 |
6 | 10044203442402 |
7 | 651510401261 |
oct | 143340376302 |
9 | 37403548512 |
10 | 13346405570 |
11 | 5729775053 |
12 | 2705826402 |
13 | 1349099b04 |
14 | 90877c5d8 |
15 | 531a7a815 |
hex | 31b81fcc2 |
13346405570 has 16 divisors (see below), whose sum is σ = 24271197048. Its totient is φ = 5283525120.
The previous prime is 13346405551. The next prime is 13346405573. The reversal of 13346405570 is 7550464331.
13346405570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 13185699241 + 160706329 = 114829^2 + 12677^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13346405573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6878621 + ... + 6880560.
Almost surely, 213346405570 is an apocalyptic number.
13346405570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13346405570 is a deficient number, since it is larger than the sum of its proper divisors (10924791478).
13346405570 is a wasteful number, since it uses less digits than its factorization.
13346405570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13759285.
The product of its (nonzero) digits is 151200, while the sum is 38.
The spelling of 13346405570 in words is "thirteen billion, three hundred forty-six million, four hundred five thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •