Base | Representation |
---|---|
bin | 1010110000101010101011… |
… | …0110100101110011100100 |
3 | 1112220001102010002021221020 |
4 | 2230022222312211303210 |
5 | 3022320302312324112 |
6 | 41055103044451140 |
7 | 2330530215564423 |
oct | 254125266456344 |
9 | 45801363067836 |
10 | 11831206370532 |
11 | 385164a61477a |
12 | 13b0b730a9ab0 |
13 | 67a8a767a823 |
14 | 2cc8c22532ba |
15 | 157b5446d48c |
hex | ac2aada5ce4 |
11831206370532 has 24 divisors (see below), whose sum is σ = 27611468472000. Its totient is φ = 3942975417696.
The previous prime is 11831206370509. The next prime is 11831206370537. The reversal of 11831206370532 is 23507360213811.
11831206370532 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11831206370537) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94940032 + ... + 95064567.
It is an arithmetic number, because the mean of its divisors is an integer number (1150477853000).
Almost surely, 211831206370532 is an apocalyptic number.
11831206370532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11831206370532 is an abundant number, since it is smaller than the sum of its proper divisors (15780262101468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11831206370532 is a wasteful number, since it uses less digits than its factorization.
11831206370532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190009795 (or 190009793 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 11831206370532 in words is "eleven trillion, eight hundred thirty-one billion, two hundred six million, three hundred seventy thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •