Base | Representation |
---|---|
bin | 11001100000001001… |
… | …00011000000000000 |
3 | 1022100011210012020000 |
4 | 30300010203000000 |
5 | 211014444301232 |
6 | 10142330120000 |
7 | 663166660431 |
oct | 146004430000 |
9 | 38304705200 |
10 | 13691400192 |
11 | 5896490678 |
12 | 27a1280000 |
13 | 13a26bc942 |
14 | 93c505488 |
15 | 551ec627c |
hex | 330123000 |
13691400192 has 260 divisors, whose sum is σ = 42340261920. Its totient is φ = 4403331072.
The previous prime is 13691400181. The next prime is 13691400193. The reversal of 13691400192 is 29100419631.
It is a happy number.
13691400192 is a `hidden beast` number, since 1 + 3 + 69 + 1 + 400 + 192 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (13691400193) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9620793 + ... + 9622215.
Almost surely, 213691400192 is an apocalyptic number.
13691400192 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 13691400192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21170130960).
13691400192 is an abundant number, since it is smaller than the sum of its proper divisors (28648861728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13691400192 is an equidigital number, since it uses as much as digits as its factorization.
13691400192 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1488 (or 1457 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 36.
The spelling of 13691400192 in words is "thirteen billion, six hundred ninety-one million, four hundred thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •