Base | Representation |
---|---|
bin | 10011111100100000000… |
… | …100001011010101010100 |
3 | 11212000211201220220201012 |
4 | 103330200010023111110 |
5 | 134424023412031312 |
6 | 2525354311551352 |
7 | 201011360206466 |
oct | 23744004132524 |
9 | 4760751826635 |
10 | 1370632533332 |
11 | 489311372987 |
12 | 1a177a08b558 |
13 | 9c3335bb76a |
14 | 4a4a61b6136 |
15 | 259bed2d322 |
hex | 13f2010b554 |
1370632533332 has 12 divisors (see below), whose sum is σ = 2407523689620. Its totient is φ = 682768622016.
The previous prime is 1370632533331. The next prime is 1370632533401. The reversal of 1370632533332 is 2333352360731.
It can be written as a sum of positive squares in 2 ways, for example, as 461252872336 + 909379660996 = 679156^2 + 953614^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1370632533332.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1370632533331) 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 3 ways as a sum of consecutive naturals, for example, 636909953 + ... + 636912104.
It is an arithmetic number, because the mean of its divisors is an integer number (200626974135).
Almost surely, 21370632533332 is an apocalyptic number.
It is an amenable number.
1370632533332 is a deficient number, since it is larger than the sum of its proper divisors (1036891156288).
1370632533332 is a wasteful number, since it uses less digits than its factorization.
1370632533332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273822330 (or 1273822328 counting only the distinct ones).
The product of its (nonzero) digits is 612360, while the sum is 41.
The spelling of 1370632533332 in words is "one trillion, three hundred seventy billion, six hundred thirty-two million, five hundred thirty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •