Base | Representation |
---|---|
bin | 1010010110111101001011… |
… | …0010010110001100001010 |
3 | 1111022211021110200021200000 |
4 | 2211233102302112030022 |
5 | 2443101141121341041 |
6 | 40120132303023430 |
7 | 2253602203504602 |
oct | 245572262261412 |
9 | 44284243607600 |
10 | 11389494715146 |
11 | 36a1291930309 |
12 | 133b43a89ab76 |
13 | 64804248c4c2 |
14 | 2b537c445c02 |
15 | 14b400b85bb6 |
hex | a5bd2c9630a |
11389494715146 has 96 divisors (see below), whose sum is σ = 26482899119040. Its totient is φ = 3664306066176.
The previous prime is 11389494715139. The next prime is 11389494715217. The reversal of 11389494715146 is 64151749498311.
It is a happy number.
11389494715146 is a `hidden beast` number, since 1 + 1 + 3 + 8 + 9 + 49 + 4 + 71 + 514 + 6 = 666.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40690845 + ... + 40969791.
It is an arithmetic number, because the mean of its divisors is an integer number (275863532490).
Almost surely, 211389494715146 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11389494715146, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13241449559520).
11389494715146 is an abundant number, since it is smaller than the sum of its proper divisors (15093404403894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11389494715146 is a wasteful number, since it uses less digits than its factorization.
11389494715146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281890 (or 281878 counting only the distinct ones).
The product of its digits is 26127360, while the sum is 63.
The spelling of 11389494715146 in words is "eleven trillion, three hundred eighty-nine billion, four hundred ninety-four million, seven hundred fifteen thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •