Base | Representation |
---|---|
bin | 1110101101101000111101… |
… | …10010001101110011110101 |
3 | 11020120001122002110200000222 |
4 | 13112310132302031303311 |
5 | 13220044011302333023 |
6 | 152451242055144125 |
7 | 6546351540612155 |
oct | 726643662156365 |
9 | 136501562420028 |
10 | 32354505121013 |
11 | a34451772a299 |
12 | 376662a375045 |
13 | 150902aa1c5ca |
14 | 7dbd75b4c765 |
15 | 3b19355aacc8 |
hex | 1d6d1ec8dcf5 |
32354505121013 has 48 divisors (see below), whose sum is σ = 35557578733824. Its totient is φ = 29416356618240.
The previous prime is 32354505121009. The next prime is 32354505121027. The reversal of 32354505121013 is 31012150545323.
It is a happy number.
It is not a de Polignac number, because 32354505121013 - 22 = 32354505121009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32354505121063) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1236732653 + ... + 1236758813.
It is an arithmetic number, because the mean of its divisors is an integer number (740782890288).
Almost surely, 232354505121013 is an apocalyptic number.
It is an amenable number.
32354505121013 is a deficient number, since it is larger than the sum of its proper divisors (3203073612811).
32354505121013 is a wasteful number, since it uses less digits than its factorization.
32354505121013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27422 (or 27405 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 32354505121013 its reverse (31012150545323), we get a palindrome (63366655666336).
The spelling of 32354505121013 in words is "thirty-two trillion, three hundred fifty-four billion, five hundred five million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •