Base | Representation |
---|---|
bin | 10111010001000111100011… |
… | …011010101100000000101010 |
3 | 111102022210020222220022010112 |
4 | 113101013203122230000222 |
5 | 101403044212240014432 |
6 | 1001350222405014322 |
7 | 30361125523614635 |
oct | 2721074332540052 |
9 | 442283228808115 |
10 | 102331411251242 |
11 | 2a673564971228 |
12 | b58861a6b43a2 |
13 | 4513a7008b9c4 |
14 | 1b3ac1c44cc1c |
15 | bc6d1c8ed7b2 |
hex | 5d11e36ac02a |
102331411251242 has 4 divisors (see below), whose sum is σ = 153497116876866. Its totient is φ = 51165705625620.
The previous prime is 102331411251203. The next prime is 102331411251299. The reversal of 102331411251242 is 242152114133201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 99419265588241 + 2912145663001 = 9970921^2 + 1706501^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102331411251199 and 102331411251208.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25582852812809 + ... + 25582852812812.
Almost surely, 2102331411251242 is an apocalyptic number.
102331411251242 is a deficient number, since it is larger than the sum of its proper divisors (51165705625624).
102331411251242 is an equidigital number, since it uses as much as digits as its factorization.
102331411251242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51165705625623.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 102331411251242 its reverse (242152114133201), we get a palindrome (344483525384443).
The spelling of 102331411251242 in words is "one hundred two trillion, three hundred thirty-one billion, four hundred eleven million, two hundred fifty-one thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •