Base | Representation |
---|---|
bin | 1011110110100100110110… |
… | …0100111101110100110001 |
3 | 1201010212110200021122012000 |
4 | 2331221031210331310301 |
5 | 3202010002432441423 |
6 | 43414531434524213 |
7 | 2513355602625000 |
oct | 275511544756461 |
9 | 51125420248160 |
10 | 13032232312113 |
11 | 4174a36432973 |
12 | 1565898296669 |
13 | 736c1b686351 |
14 | 330a98b1cc37 |
15 | 178ee9261843 |
hex | bda4d93dd31 |
13032232312113 has 64 divisors (see below), whose sum is σ = 22531885248000. Its totient is φ = 7441558750080.
The previous prime is 13032232312111. The next prime is 13032232312123. The reversal of 13032232312113 is 31121323223031.
13032232312113 is a `hidden beast` number, since 1 + 3 + 0 + 3 + 2 + 232 + 312 + 113 = 666.
It is not a de Polignac number, because 13032232312113 - 21 = 13032232312111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13032232312111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12202893 + ... + 13227813.
It is an arithmetic number, because the mean of its divisors is an integer number (352060707000).
Almost surely, 213032232312113 is an apocalyptic number.
It is an amenable number.
13032232312113 is a deficient number, since it is larger than the sum of its proper divisors (9499652935887).
13032232312113 is a wasteful number, since it uses less digits than its factorization.
13032232312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026324 (or 1026304 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 13032232312113 its reverse (31121323223031), we get a palindrome (44153555535144).
The spelling of 13032232312113 in words is "thirteen trillion, thirty-two billion, two hundred thirty-two million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •