Base | Representation |
---|---|
bin | 101111011111111001… |
… | …110000111011010011 |
3 | 11212122100120102110000 |
4 | 233133321300323103 |
5 | 1313422240231120 |
6 | 35232442341043 |
7 | 3453566133402 |
oct | 573771607323 |
9 | 155570512400 |
10 | 51001102035 |
11 | 1a6a1879904 |
12 | 9a741ba783 |
13 | 4a6a2a46b0 |
14 | 267b687639 |
15 | 14d76e2990 |
hex | bdfe70ed3 |
51001102035 has 40 divisors (see below), whose sum is σ = 98456838480. Its totient is φ = 25108232256.
The previous prime is 51001102007. The next prime is 51001102069. The reversal of 51001102035 is 53020110015.
It is not a de Polignac number, because 51001102035 - 29 = 51001101523 is a prime.
It is a super-2 number, since 2×510011020352 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51001101999 and 51001102017.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4838145 + ... + 4848674.
It is an arithmetic number, because the mean of its divisors is an integer number (2461420962).
Almost surely, 251001102035 is an apocalyptic number.
51001102035 is a deficient number, since it is larger than the sum of its proper divisors (47455736445).
51001102035 is a wasteful number, since it uses less digits than its factorization.
51001102035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9686849 (or 9686840 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The spelling of 51001102035 in words is "fifty-one billion, one million, one hundred two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •