Base | Representation |
---|---|
bin | 11110010111010100110… |
… | …11011000101010101110 |
3 | 10200201222102111011200000 |
4 | 33023222123120222232 |
5 | 114043202133224402 |
6 | 2115143052045130 |
7 | 135243215210634 |
oct | 17135233305256 |
9 | 3621872434600 |
10 | 1043315133102 |
11 | 372516214560 |
12 | 14a2501637a6 |
13 | 774cc0cb508 |
14 | 386d500d354 |
15 | 1c2142dec1c |
hex | f2ea6d8aae |
1043315133102 has 48 divisors (see below), whose sum is σ = 2557351585152. Its totient is φ = 316156099320.
The previous prime is 1043315133043. The next prime is 1043315133139. The reversal of 1043315133102 is 2013315133401.
1043315133102 is a `hidden beast` number, since 1 + 0 + 4 + 331 + 5 + 13 + 310 + 2 = 666.
It is a super-2 number, since 2×10433151331022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 23 ways as a sum of consecutive naturals, for example, 97573698 + ... + 97584389.
It is an arithmetic number, because the mean of its divisors is an integer number (53278158024).
Almost surely, 21043315133102 is an apocalyptic number.
1043315133102 is an abundant number, since it is smaller than the sum of its proper divisors (1514036452050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043315133102 is a wasteful number, since it uses less digits than its factorization.
1043315133102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195158115 (or 195158103 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The spelling of 1043315133102 in words is "one trillion, forty-three billion, three hundred fifteen million, one hundred thirty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •