Base | Representation |
---|---|
bin | 101000101011101… |
… | …0111110000000000 |
3 | 10112010122022012211 |
4 | 1101113113300000 |
5 | 10243430043323 |
6 | 343242231504 |
7 | 45553666150 |
oct | 12127276000 |
9 | 3463568184 |
10 | 1365081088 |
11 | 640609698 |
12 | 3211b5594 |
13 | 189a738b7 |
14 | cd422760 |
15 | 7ec9870d |
hex | 515d7c00 |
1365081088 has 88 divisors (see below), whose sum is σ = 3141113312. Its totient is φ = 580829184.
The previous prime is 1365081083. The next prime is 1365081103. The reversal of 1365081088 is 8801805631.
It is a self number, because there is not a number n which added to its sum of digits gives 1365081088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1365081083) by changing a digit.
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, 1124770 + ... + 1125982.
Almost surely, 21365081088 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 1365081088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1570556656).
1365081088 is an abundant number, since it is smaller than the sum of its proper divisors (1776032224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1365081088 is a wasteful number, since it uses less digits than its factorization.
1365081088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1397 (or 1379 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 40.
The square root of 1365081088 is about 36947.0037756785. The cubic root of 1365081088 is about 1109.3097155557.
The spelling of 1365081088 in words is "one billion, three hundred sixty-five million, eighty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •