Base | Representation |
---|---|
bin | 11000101001100010… |
… | …00110111010010100 |
3 | 1021011020211021202010 |
4 | 30110301012322110 |
5 | 204100212211242 |
6 | 10025043544220 |
7 | 645635234424 |
oct | 142461067224 |
9 | 37136737663 |
10 | 13233319572 |
11 | 5680955950 |
12 | 269398b070 |
13 | 132b823c15 |
14 | 8d7742484 |
15 | 526b8d89c |
hex | 314c46e94 |
13233319572 has 48 divisors (see below), whose sum is σ = 34506408384. Its totient is φ = 3912288000.
The previous prime is 13233319553. The next prime is 13233319591. The reversal of 13233319572 is 27591333231.
It is an interprime number because it is at equal distance from previous prime (13233319553) and next prime (13233319591).
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13233319572.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1217179 + ... + 1228002.
It is an arithmetic number, because the mean of its divisors is an integer number (718883508).
Almost surely, 213233319572 is an apocalyptic number.
13233319572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13233319572 is an abundant number, since it is smaller than the sum of its proper divisors (21273088812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13233319572 is a wasteful number, since it uses less digits than its factorization.
13233319572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445240 (or 2445238 counting only the distinct ones).
The product of its digits is 102060, while the sum is 39.
The spelling of 13233319572 in words is "thirteen billion, two hundred thirty-three million, three hundred nineteen thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •