Base | Representation |
---|---|
bin | 100100101000101100111… |
… | …1010100110000011000010 |
3 | 122211100202110022210010000 |
4 | 1021101121322212003002 |
5 | 1124444102303001310 |
6 | 14413051005220430 |
7 | 1026532126360146 |
oct | 111213172460302 |
9 | 18740673283100 |
10 | 5035210203330 |
11 | 167146998a45a |
12 | 693a35861716 |
13 | 2a6a83a054c8 |
14 | 1359c3b6d226 |
15 | 8ae9d9744c0 |
hex | 49459ea60c2 |
5035210203330 has 80 divisors (see below), whose sum is σ = 14335539676920. Its totient is φ = 1263739027968.
The previous prime is 5035210203323. The next prime is 5035210203371. The reversal of 5035210203330 is 333020125305.
5035210203330 is a `hidden beast` number, since 503 + 52 + 102 + 0 + 3 + 3 + 3 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 4871833371729 + 163376831601 = 2207223^2 + 404199^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5035210203294 and 5035210203303.
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, 182818845 + ... + 182846384.
Almost surely, 25035210203330 is an apocalyptic number.
5035210203330 is an abundant number, since it is smaller than the sum of its proper divisors (9300329473590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5035210203330 is a wasteful number, since it uses less digits than its factorization.
5035210203330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365665265 (or 365665256 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 27.
Adding to 5035210203330 its reverse (333020125305), we get a palindrome (5368230328635).
The spelling of 5035210203330 in words is "five trillion, thirty-five billion, two hundred ten million, two hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •