Base | Representation |
---|---|
bin | 1001010011101101111011… |
… | …0100111100101011001010 |
3 | 1100020101122111002012121120 |
4 | 2110323132310330223022 |
5 | 2320134422213133114 |
6 | 33433332402020110 |
7 | 2104256514041043 |
oct | 224733664745312 |
9 | 40211574065546 |
10 | 10234350521034 |
11 | 3296400073082 |
12 | 119359b347636 |
13 | 593130c6a593 |
14 | 2754b93738ca |
15 | 12b343e045a9 |
hex | 94eded3caca |
10234350521034 has 8 divisors (see below), whose sum is σ = 20468701042080. Its totient is φ = 3411450173676.
The previous prime is 10234350521033. The next prime is 10234350521039. The reversal of 10234350521034 is 43012505343201.
It is a sphenic number, since it is the product of 3 distinct primes.
10234350521034 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10234350520986 and 10234350521004.
It is not an unprimeable number, because it can be changed into a prime (10234350521033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 852862543414 + ... + 852862543425.
It is an arithmetic number, because the mean of its divisors is an integer number (2558587630260).
Almost surely, 210234350521034 is an apocalyptic number.
10234350521034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10234350521034 is a wasteful number, since it uses less digits than its factorization.
10234350521034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1705725086844.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 10234350521034 its reverse (43012505343201), we get a palindrome (53246855864235).
The spelling of 10234350521034 in words is "ten trillion, two hundred thirty-four billion, three hundred fifty million, five hundred twenty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •