Base | Representation |
---|---|
bin | 10000000001101010001111… |
… | …11101101000000110011010 |
3 | 11121210001020201211210200110 |
4 | 20000311013331220012122 |
5 | 14104343403441013200 |
6 | 202541403155345150 |
7 | 10265052043324245 |
oct | 1000650775500632 |
9 | 147701221753613 |
10 | 35241414001050 |
11 | 10257888509764 |
12 | 3b520322b21b6 |
13 | 168833581643a |
14 | 89b99d0da25c |
15 | 411a9b664b50 |
hex | 200d47f6819a |
35241414001050 has 96 divisors (see below), whose sum is σ = 94343431812480. Its totient is φ = 8679144812800.
The previous prime is 35241414000979. The next prime is 35241414001093. The reversal of 35241414001050 is 5010041414253.
It is a super-2 number, since 2×352414140010502 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 35241414000999 and 35241414001017.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 176018961 + ... + 176219060.
It is an arithmetic number, because the mean of its divisors is an integer number (982744081380).
Almost surely, 235241414001050 is an apocalyptic number.
35241414001050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
35241414001050 is an abundant number, since it is smaller than the sum of its proper divisors (59102017811430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35241414001050 is a wasteful number, since it uses less digits than its factorization.
35241414001050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 352238088 (or 352238083 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The spelling of 35241414001050 in words is "thirty-five trillion, two hundred forty-one billion, four hundred fourteen million, one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •