Base | Representation |
---|---|
bin | 10111011111101011100001… |
… | …111101111011001100100101 |
3 | 111112212110020201021000102202 |
4 | 113133223201331323030211 |
5 | 102020443132231022041 |
6 | 1003434041252344245 |
7 | 30523333056402455 |
oct | 2737534175731445 |
9 | 445773221230382 |
10 | 103332114314021 |
11 | 2aa199a373863a |
12 | b70a558015085 |
13 | 458723abc9a08 |
14 | 1b7342ddc9d65 |
15 | be2d8ac3ea9b |
hex | 5dfae1f7b325 |
103332114314021 has 8 divisors (see below), whose sum is σ = 103797459983040. Its totient is φ = 102867806206368.
The previous prime is 103332114313979. The next prime is 103332114314029. The reversal of 103332114314021 is 120413411233301.
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 103332114314021 - 26 = 103332114313957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103332114314029) 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, 259190711 + ... + 259589076.
It is an arithmetic number, because the mean of its divisors is an integer number (12974682497880).
Almost surely, 2103332114314021 is an apocalyptic number.
It is an amenable number.
103332114314021 is a deficient number, since it is larger than the sum of its proper divisors (465345669019).
103332114314021 is an equidigital number, since it uses as much as digits as its factorization.
103332114314021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 518780683.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 103332114314021 its reverse (120413411233301), we get a palindrome (223745525547322).
The spelling of 103332114314021 in words is "one hundred three trillion, three hundred thirty-two billion, one hundred fourteen million, three hundred fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •