Base | Representation |
---|---|
bin | 101011101010010111100… |
… | …100100111111100100111 |
3 | 101121211122010122022001010 |
4 | 223222113210213330213 |
5 | 343124340103224111 |
6 | 10214213434433303 |
7 | 426526312220202 |
oct | 53522744477447 |
9 | 11554563568033 |
10 | 3000430133031 |
11 | a57525653021 |
12 | 405605b92833 |
13 | 189c29991ba6 |
14 | a53160a2939 |
15 | 530ac3aaaa6 |
hex | 2ba97927f27 |
3000430133031 has 8 divisors (see below), whose sum is σ = 4005593054064. Its totient is φ = 1997776983680.
The previous prime is 3000430133011. The next prime is 3000430133039. The reversal of 3000430133031 is 1303310340003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3000430133031 - 214 = 3000430116647 is a prime.
It is a super-2 number, since 2×30004301330312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3000430132989 and 3000430133007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3000430133039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 627440130 + ... + 627444911.
It is an arithmetic number, because the mean of its divisors is an integer number (500699131758).
Almost surely, 23000430133031 is an apocalyptic number.
3000430133031 is a deficient number, since it is larger than the sum of its proper divisors (1005162921033).
3000430133031 is a wasteful number, since it uses less digits than its factorization.
3000430133031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254885841.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 3000430133031 its reverse (1303310340003), we get a palindrome (4303740473034).
The spelling of 3000430133031 in words is "three trillion, four hundred thirty million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •