Base | Representation |
---|---|
bin | 10110101111011110111011… |
… | …010101111001100111000001 |
3 | 111010010211020000100100202020 |
4 | 112233132323111321213001 |
5 | 101102212023401033322 |
6 | 552420324112512053 |
7 | 30032131664455413 |
oct | 2657367325714701 |
9 | 433124200310666 |
10 | 100020046502337 |
11 | 29962299808085 |
12 | b27467b24b629 |
13 | 43a6b08352c50 |
14 | 1a9add33609b3 |
15 | b86b3e67405c |
hex | 5af7bb5799c1 |
100020046502337 has 64 divisors (see below), whose sum is σ = 144495983503872. Its totient is φ = 61176084480000.
The previous prime is 100020046502303. The next prime is 100020046502377. The reversal of 100020046502337 is 733205640020001.
It is not a de Polignac number, because 100020046502337 - 26 = 100020046502273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100020046502298 and 100020046502307.
It is not an unprimeable number, because it can be changed into a prime (100020046502377) 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 63 ways as a sum of consecutive naturals, for example, 8951936283 + ... + 8951947455.
It is an arithmetic number, because the mean of its divisors is an integer number (2257749742248).
Almost surely, 2100020046502337 is an apocalyptic number.
It is an amenable number.
100020046502337 is a deficient number, since it is larger than the sum of its proper divisors (44475937001535).
100020046502337 is a wasteful number, since it uses less digits than its factorization.
100020046502337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13562.
The product of its (nonzero) digits is 30240, while the sum is 33.
Adding to 100020046502337 its reverse (733205640020001), we get a palindrome (833225686522338).
The spelling of 100020046502337 in words is "one hundred trillion, twenty billion, forty-six million, five hundred two thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •