Base | Representation |
---|---|
bin | 11100001011111111… |
… | …10101011010011100 |
3 | 1110001122102022220000 |
4 | 32011333311122130 |
5 | 221443022133333 |
6 | 10541344454300 |
7 | 1044003265320 |
oct | 160577653234 |
9 | 43048368800 |
10 | 15133005468 |
11 | 6466206a99 |
12 | 2b2401a390 |
13 | 1572277809 |
14 | a37b67980 |
15 | 5d8838713 |
hex | 385ff569c |
15133005468 has 120 divisors (see below), whose sum is σ = 47591913600. Its totient is φ = 4096140192.
The previous prime is 15133005463. The next prime is 15133005473. The reversal of 15133005468 is 86450033151.
15133005468 is a `hidden beast` number, since 1 + 513 + 30 + 0 + 54 + 68 = 666.
It is an interprime number because it is at equal distance from previous prime (15133005463) and next prime (15133005473).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15133005463) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 132498 + ... + 218681.
It is an arithmetic number, because the mean of its divisors is an integer number (396599280).
Almost surely, 215133005468 is an apocalyptic number.
15133005468 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
15133005468 is an abundant number, since it is smaller than the sum of its proper divisors (32458908132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15133005468 is a wasteful number, since it uses less digits than its factorization.
15133005468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351221 (or 351210 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 15133005468 in words is "fifteen billion, one hundred thirty-three million, five thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •