Base | Representation |
---|---|
bin | 11110000001010100011001… |
… | …001111011011001001111011 |
3 | 122022111010201000012010202120 |
4 | 132001110121033123021323 |
5 | 114301203030324320443 |
6 | 1144450400335132323 |
7 | 36544666240223334 |
oct | 3601243117331173 |
9 | 568433630163676 |
10 | 132032013120123 |
11 | 3908450a37aa86 |
12 | 129848320740a3 |
13 | 58897472a078c |
14 | 24865525a928b |
15 | 103e6c7ca5083 |
hex | 7815193db27b |
132032013120123 has 4 divisors (see below), whose sum is σ = 176042684160168. Its totient is φ = 88021342080080.
The previous prime is 132032013120121. The next prime is 132032013120131. The reversal of 132032013120123 is 321021310230231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132032013120123 - 21 = 132032013120121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132032013120093 and 132032013120102.
It is not an unprimeable number, because it can be changed into a prime (132032013120121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22005335520018 + ... + 22005335520023.
It is an arithmetic number, because the mean of its divisors is an integer number (44010671040042).
Almost surely, 2132032013120123 is an apocalyptic number.
132032013120123 is a deficient number, since it is larger than the sum of its proper divisors (44010671040045).
132032013120123 is an equidigital number, since it uses as much as digits as its factorization.
132032013120123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44010671040044.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 132032013120123 its reverse (321021310230231), we get a palindrome (453053323350354).
The spelling of 132032013120123 in words is "one hundred thirty-two trillion, thirty-two billion, thirteen million, one hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •