Base | Representation |
---|---|
bin | 11101001110011000000… |
… | …01111100100011111011 |
3 | 10112222212222012201212211 |
4 | 32213030001330203323 |
5 | 112423000003122420 |
6 | 2045144512515551 |
7 | 132355532633503 |
oct | 16471401744373 |
9 | 3488788181784 |
10 | 1004150442235 |
11 | 357948823646 |
12 | 14273bb4bbb7 |
13 | 738ca112515 |
14 | 3685b75ca03 |
15 | 1b1c0d06e5a |
hex | e9cc07c8fb |
1004150442235 has 4 divisors (see below), whose sum is σ = 1204980530688. Its totient is φ = 803320353784.
The previous prime is 1004150442221. The next prime is 1004150442277. The reversal of 1004150442235 is 5322440514001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1004150442235 - 25 = 1004150442203 is a prime.
It is a super-3 number, since 3×10041504422353 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1004150442197 and 1004150442206.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100415044219 + ... + 100415044228.
It is an arithmetic number, because the mean of its divisors is an integer number (301245132672).
Almost surely, 21004150442235 is an apocalyptic number.
1004150442235 is a deficient number, since it is larger than the sum of its proper divisors (200830088453).
1004150442235 is an equidigital number, since it uses as much as digits as its factorization.
1004150442235 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200830088452.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 1004150442235 its reverse (5322440514001), we get a palindrome (6326590956236).
The spelling of 1004150442235 in words is "one trillion, four billion, one hundred fifty million, four hundred forty-two thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •