Search a number
-
+
133662924850752 = 263311101149346633
BaseRepresentation
bin11110011001000011010011…
…001001111100011001000000
3122112021001101001100020102000
4132121003103021330121000
5120004413132230211002
61152135522221424000
740103553611213133
oct3631032311743100
9575231331306360
10133662924850752
1139653145547190
1212ba892b10b000
13597748a43178b
14250146a43221a
15106bd2d05a61c
hex7990d327c640

133662924850752 has 448 divisors, whose sum is σ = 433209923032320. Its totient is φ = 40075167744000.

The previous prime is 133662924850717. The next prime is 133662924850783. The reversal of 133662924850752 is 257058429266331.

133662924850752 is a `hidden beast` number, since 1 + 3 + 3 + 6 + 62 + 92 + 485 + 0 + 7 + 5 + 2 = 666.

It is a super-2 number, since 2×1336629248507522 (a number of 29 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 133662924850752.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2866250028 + ... + 2866296660.

It is an arithmetic number, because the mean of its divisors is an integer number (966986435340).

It is a 2-persistent number, because it is pandigital, and so is 2⋅133662924850752 = 267325849701504, but 3⋅133662924850752 = 400988774552256 is not.

Almost surely, 2133662924850752 is an apocalyptic number.

133662924850752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 133662924850752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216604961516160).

133662924850752 is an abundant number, since it is smaller than the sum of its proper divisors (299546998181568).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

133662924850752 is a wasteful number, since it uses less digits than its factorization.

133662924850752 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 48259 (or 48243 counting only the distinct ones).

The product of its (nonzero) digits is 130636800, while the sum is 63.

The spelling of 133662924850752 in words is "one hundred thirty-three trillion, six hundred sixty-two billion, nine hundred twenty-four million, eight hundred fifty thousand, seven hundred fifty-two".