Base | Representation |
---|---|
bin | 1100010011110011011101… |
… | …1011111000111000001001 |
3 | 1202220212120122201010121100 |
4 | 3010330313123320320021 |
5 | 3233221343213214213 |
6 | 44441334335132013 |
7 | 2564553232620204 |
oct | 304746733707011 |
9 | 52825518633540 |
10 | 13534372007433 |
11 | 4348993181102 |
12 | 1627075974009 |
13 | 772393bacc14 |
14 | 34b0d21a293b |
15 | 1870d7b4d773 |
hex | c4f376f8e09 |
13534372007433 has 12 divisors (see below), whose sum is σ = 20699627776308. Its totient is φ = 8492154984960.
The previous prime is 13534372007417. The next prime is 13534372007437. The reversal of 13534372007433 is 33470027343531.
13534372007433 is a `hidden beast` number, since 1 + 3 + 5 + 3 + 4 + 3 + 7 + 200 + 7 + 433 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5603597964864 + 7930774042569 = 2367192^2 + 2816163^2 .
It is not a de Polignac number, because 13534372007433 - 24 = 13534372007417 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13534372007437) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 44229973728 + ... + 44229974033.
It is an arithmetic number, because the mean of its divisors is an integer number (1724968981359).
Almost surely, 213534372007433 is an apocalyptic number.
It is an amenable number.
13534372007433 is a deficient number, since it is larger than the sum of its proper divisors (7165255768875).
13534372007433 is a wasteful number, since it uses less digits than its factorization.
13534372007433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88459947784 (or 88459947781 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 45.
The spelling of 13534372007433 in words is "thirteen trillion, five hundred thirty-four billion, three hundred seventy-two million, seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •