Base | Representation |
---|---|
bin | 11110000110101000101… |
… | …11101111001011110100 |
3 | 10122212211222200112111000 |
4 | 33003110113233023310 |
5 | 113421324404042122 |
6 | 2111102020243300 |
7 | 134505166440003 |
oct | 17032427571364 |
9 | 3585758615430 |
10 | 1034355143412 |
11 | 3697385706a8 |
12 | 14856b540530 |
13 | 76701a19676 |
14 | 380c5050c3a |
15 | 1bd8c8b80ac |
hex | f0d45ef2f4 |
1034355143412 has 48 divisors (see below), whose sum is σ = 2681716423680. Its totient is φ = 344777984064.
The previous prime is 1034355143387. The next prime is 1034355143447. The reversal of 1034355143412 is 2143415534301.
1034355143412 is a `hidden beast` number, since 10 + 3 + 43 + 55 + 143 + 412 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9796333 + ... + 9901355.
It is an arithmetic number, because the mean of its divisors is an integer number (55869092160).
Almost surely, 21034355143412 is an apocalyptic number.
1034355143412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1034355143412 is an abundant number, since it is smaller than the sum of its proper divisors (1647361280268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1034355143412 is a wasteful number, since it uses less digits than its factorization.
1034355143412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196229 (or 196221 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 1034355143412 in words is "one trillion, thirty-four billion, three hundred fifty-five million, one hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •