Base | Representation |
---|---|
bin | 10110111110001101110111… |
… | …100011001101101000111101 |
3 | 111020201121121010112102211111 |
4 | 112332031313203031220331 |
5 | 101220304100441022141 |
6 | 554513411040122021 |
7 | 30165234031343650 |
oct | 2676156743155075 |
9 | 436647533472744 |
10 | 101032521423421 |
11 | 2a212719481905 |
12 | b3b8943006311 |
13 | 444b430c972a3 |
14 | 1ad40004cd897 |
15 | ba314b1bd381 |
hex | 5be3778cda3d |
101032521423421 has 32 divisors (see below), whose sum is σ = 116393919280128. Its totient is φ = 85906054656000.
The previous prime is 101032521423343. The next prime is 101032521423439. The reversal of 101032521423421 is 124324125230101.
It is a cyclic number.
It is not a de Polignac number, because 101032521423421 - 227 = 101032387205693 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101032521423481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4354275406 + ... + 4354298608.
It is an arithmetic number, because the mean of its divisors is an integer number (3637309977504).
Almost surely, 2101032521423421 is an apocalyptic number.
It is an amenable number.
101032521423421 is a deficient number, since it is larger than the sum of its proper divisors (15361397856707).
101032521423421 is a wasteful number, since it uses less digits than its factorization.
101032521423421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33361.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 101032521423421 its reverse (124324125230101), we get a palindrome (225356646653522).
The spelling of 101032521423421 in words is "one hundred one trillion, thirty-two billion, five hundred twenty-one million, four hundred twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •