Base | Representation |
---|---|
bin | 11110010011110000111… |
… | …01111111000101100101 |
3 | 10200120001011212112011021 |
4 | 33021320131333011211 |
5 | 114030243210242013 |
6 | 2114225233011141 |
7 | 135144641151214 |
oct | 17117035770545 |
9 | 3616034775137 |
10 | 1041403212133 |
11 | 371724a66a89 |
12 | 1499b79b3ab1 |
13 | 77285c8292b |
14 | 3859312107b |
15 | 1c151529a8d |
hex | f27877f165 |
1041403212133 has 8 divisors (see below), whose sum is σ = 1052203445888. Its totient is φ = 1030604287104.
The previous prime is 1041403212127. The next prime is 1041403212169. The reversal of 1041403212133 is 3312123041401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1041403212133 - 233 = 1032813277541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1041403212098 and 1041403212107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041403222133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1315060 + ... + 1952482.
It is an arithmetic number, because the mean of its divisors is an integer number (131525430736).
Almost surely, 21041403212133 is an apocalyptic number.
It is an amenable number.
1041403212133 is a deficient number, since it is larger than the sum of its proper divisors (10800233755).
1041403212133 is an equidigital number, since it uses as much as digits as its factorization.
1041403212133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 654363.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1041403212133 its reverse (3312123041401), we get a palindrome (4353526253534).
The spelling of 1041403212133 in words is "one trillion, forty-one billion, four hundred three million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •