Base | Representation |
---|---|
bin | 1010101011101010… |
… | …11001111101100111 |
3 | 112210200110202000220 |
4 | 11111311121331213 |
5 | 43221131440011 |
6 | 2345025335423 |
7 | 262055645631 |
oct | 52565317547 |
9 | 15720422026 |
10 | 5735030631 |
11 | 2483303440 |
12 | 1140797573 |
13 | 705214965 |
14 | 3c5957a51 |
15 | 238748506 |
hex | 155d59f67 |
5735030631 has 64 divisors (see below), whose sum is σ = 9045872640. Its totient is φ = 3193136640.
The previous prime is 5735030629. The next prime is 5735030647. The reversal of 5735030631 is 1360305375.
It is not a de Polignac number, because 5735030631 - 21 = 5735030629 is a prime.
It is a super-2 number, since 2×57350306312 = 65781152677016516322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5735030592 and 5735030601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5735030621) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5394606 + ... + 5395668.
It is an arithmetic number, because the mean of its divisors is an integer number (141341760).
Almost surely, 25735030631 is an apocalyptic number.
5735030631 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5735030631 is a deficient number, since it is larger than the sum of its proper divisors (3310842009).
5735030631 is a wasteful number, since it uses less digits than its factorization.
5735030631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316.
The product of its (nonzero) digits is 28350, while the sum is 33.
The square root of 5735030631 is about 75729.9850191455. The cubic root of 5735030631 is about 1789.9679187575.
The spelling of 5735030631 in words is "five billion, seven hundred thirty-five million, thirty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •