Base | Representation |
---|---|
bin | 1001001000011111100001… |
… | …0111101010011000110100 |
3 | 1022112221212210012021222022 |
4 | 2102013320113222120310 |
5 | 2304010000403221002 |
6 | 33205000504252312 |
7 | 2054321603435600 |
oct | 222077027523064 |
9 | 38487783167868 |
10 | 10041505523252 |
11 | 32216400a4a55 |
12 | 116213ba71098 |
13 | 57abaa0b5038 |
14 | 26a02363a500 |
15 | 126308bb5ba2 |
hex | 921f85ea634 |
10041505523252 has 36 divisors (see below), whose sum is σ = 20499544702980. Its totient is φ = 4291311112704.
The previous prime is 10041505523251. The next prime is 10041505523299. The reversal of 10041505523252 is 25232550514001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 6556242186256 + 3485263336996 = 2560516^2 + 1866886^2 .
It is a super-3 number, since 3×100415055232523 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10041505523251) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72497627 + ... + 72636002.
It is an arithmetic number, because the mean of its divisors is an integer number (569431797305).
Almost surely, 210041505523252 is an apocalyptic number.
It is an amenable number.
10041505523252 is an abundant number, since it is smaller than the sum of its proper divisors (10458039179728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10041505523252 is a wasteful number, since it uses less digits than its factorization.
10041505523252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145134000 (or 145133991 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 10041505523252 in words is "ten trillion, forty-one billion, five hundred five million, five hundred twenty-three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •