Base | Representation |
---|---|
bin | 1011110110100100011011… |
… | …1100011000100000111000 |
3 | 1201010212011220211220201010 |
4 | 2331221012330120200320 |
5 | 3202004240434311412 |
6 | 43414512421153520 |
7 | 2513353051601502 |
oct | 275510674304070 |
9 | 51125156756633 |
10 | 13032121010232 |
11 | 4174989622145 |
12 | 1565866b5b8a0 |
13 | 736c015b654c |
14 | 330a88028d72 |
15 | 178ede5c833c |
hex | bda46f18838 |
13032121010232 has 32 divisors (see below), whose sum is σ = 32580439076880. Its totient is φ = 4344022129920.
The previous prime is 13032121010221. The next prime is 13032121010243. The reversal of 13032121010232 is 23201012123031.
It is an interprime number because it is at equal distance from previous prime (13032121010221) and next prime (13032121010243).
It is a junction number, because it is equal to n+sod(n) for n = 13032121010199 and 13032121010208.
It is a congruent number.
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, 5497188 + ... + 7502220.
Almost surely, 213032121010232 is an apocalyptic number.
13032121010232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13032121010232 is an abundant number, since it is smaller than the sum of its proper divisors (19548318066648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032121010232 is a wasteful number, since it uses less digits than its factorization.
13032121010232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2275863 (or 2275859 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13032121010232 its reverse (23201012123031), we get a palindrome (36233133133263).
The spelling of 13032121010232 in words is "thirteen trillion, thirty-two billion, one hundred twenty-one million, ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •