Base | Representation |
---|---|
bin | 101000111011110… |
… | …0000101110000000 |
3 | 10112201111100121121 |
4 | 1101313200232000 |
5 | 10303104201212 |
6 | 344143002024 |
7 | 46015416634 |
oct | 12167405600 |
9 | 3481440547 |
10 | 1373506432 |
11 | 645343791 |
12 | 323b99314 |
13 | 18b7337cc |
14 | d05b6dc4 |
15 | 808aed07 |
hex | 51de0b80 |
1373506432 has 64 divisors (see below), whose sum is σ = 2940794640. Its totient is φ = 636641280.
The previous prime is 1373506423. The next prime is 1373506451. The reversal of 1373506432 is 2346053731.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141082 + ... + 150502.
Almost surely, 21373506432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1373506432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1470397320).
1373506432 is an abundant number, since it is smaller than the sum of its proper divisors (1567288208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1373506432 is an equidigital number, since it uses as much as digits as its factorization.
1373506432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9519 (or 9507 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 34.
The square root of 1373506432 is about 37060.8476967271. The cubic root of 1373506432 is about 1111.5872732942.
The spelling of 1373506432 in words is "one billion, three hundred seventy-three million, five hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •