Base | Representation |
---|---|
bin | 11111000111000010000… |
… | …10110100000001000000 |
3 | 10210012002101200020102110 |
4 | 33203201002310001000 |
5 | 120003130420002402 |
6 | 2135020350015320 |
7 | 140141006560365 |
oct | 17434102640100 |
9 | 3705071606373 |
10 | 1068927500352 |
11 | 382369786118 |
12 | 1531b97a7540 |
13 | 79a514707ca |
14 | 39a4483c46c |
15 | 1cc12b2456c |
hex | f8e10b4040 |
1068927500352 has 56 divisors (see below), whose sum is σ = 2994568962336. Its totient is φ = 335349803008.
The previous prime is 1068927500351. The next prime is 1068927500371. The reversal of 1068927500352 is 2530057298601.
It is a super-2 number, since 2×10689275003522 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (1068927500351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 163741758 + ... + 163748285.
It is an arithmetic number, because the mean of its divisors is an integer number (53474445756).
Almost surely, 21068927500352 is an apocalyptic number.
1068927500352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1068927500352 is an abundant number, since it is smaller than the sum of its proper divisors (1925641461984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1068927500352 is a wasteful number, since it uses less digits than its factorization.
1068927500352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327490075 (or 327490065 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 48.
The spelling of 1068927500352 in words is "one trillion, sixty-eight billion, nine hundred twenty-seven million, five hundred thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •