Base | Representation |
---|---|
bin | 1010010001110011100011… |
… | …1101010000000101010010 |
3 | 1111000100220010121111112120 |
4 | 2210130320331100011102 |
5 | 2440123434210132110 |
6 | 40011340413435110 |
7 | 2244320450422305 |
oct | 244347075200522 |
9 | 44010803544476 |
10 | 11301014536530 |
11 | 36678080a8554 |
12 | 1326266a9ba96 |
13 | 63c8b14ac524 |
14 | 2b0d8732ab3c |
15 | 148e72e6b870 |
hex | a4738f50152 |
11301014536530 has 32 divisors (see below), whose sum is σ = 28301671188864. Its totient is φ = 2882577620736.
The previous prime is 11301014536501. The next prime is 11301014536549. The reversal of 11301014536530 is 3563541010311.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11301014536491 and 11301014536500.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8189140279 + ... + 8189141658.
It is an arithmetic number, because the mean of its divisors is an integer number (884427224652).
Almost surely, 211301014536530 is an apocalyptic number.
11301014536530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11301014536530 is an abundant number, since it is smaller than the sum of its proper divisors (17000656652334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11301014536530 is a wasteful number, since it uses less digits than its factorization.
11301014536530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16378281970.
The product of its (nonzero) digits is 16200, while the sum is 33.
Adding to 11301014536530 its reverse (3563541010311), we get a palindrome (14864555546841).
The spelling of 11301014536530 in words is "eleven trillion, three hundred one billion, fourteen million, five hundred thirty-six thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •