Base | Representation |
---|---|
bin | 1011110100101101001110… |
… | …1110110110011110100000 |
3 | 1201000210120221112102120210 |
4 | 2331023103232312132200 |
5 | 3200443223031441112 |
6 | 43352101343334120 |
7 | 2511141113625603 |
oct | 275132356663640 |
9 | 51023527472523 |
10 | 13000123312032 |
11 | 416235977396a |
12 | 155b616bb1340 |
13 | 733ba23a1a0c |
14 | 32d2d056433a |
15 | 17826a3e3b3c |
hex | bd2d3bb67a0 |
13000123312032 has 48 divisors (see below), whose sum is σ = 35302059001440. Its totient is φ = 4183947731712.
The previous prime is 13000123312021. The next prime is 13000123312081. The reversal of 13000123312032 is 23021332100031.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×130001233120322 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2334789478 + ... + 2334795045.
It is an arithmetic number, because the mean of its divisors is an integer number (735459562530).
Almost surely, 213000123312032 is an apocalyptic number.
13000123312032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13000123312032 is an abundant number, since it is smaller than the sum of its proper divisors (22301935689408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13000123312032 is a wasteful number, since it uses less digits than its factorization.
13000123312032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4669584565 (or 4669584557 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13000123312032 its reverse (23021332100031), we get a palindrome (36021455412063).
The spelling of 13000123312032 in words is "thirteen trillion, one hundred twenty-three million, three hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •