Base | Representation |
---|---|
bin | 10000101010011110001… |
… | …001110000110111010010 |
3 | 11001110202000020222011102 |
4 | 100222132021300313102 |
5 | 122230143323112211 |
6 | 2234020341144402 |
7 | 145506003004301 |
oct | 20523611606722 |
9 | 4043660228142 |
10 | 1145114660306 |
11 | 401705411021 |
12 | 165b206bb102 |
13 | 83ca3693a46 |
14 | 3d5d1062438 |
15 | 1ebc14dca3b |
hex | 10a9e270dd2 |
1145114660306 has 8 divisors (see below), whose sum is σ = 1718317982640. Its totient is φ = 572341999428.
The previous prime is 1145114660279. The next prime is 1145114660309. The reversal of 1145114660306 is 6030664115411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11451146603062 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1145114660306.
It is not an unprimeable number, because it can be changed into a prime (1145114660309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107658716 + ... + 107669351.
It is an arithmetic number, because the mean of its divisors is an integer number (214789747830).
Almost surely, 21145114660306 is an apocalyptic number.
1145114660306 is a deficient number, since it is larger than the sum of its proper divisors (573203322334).
1145114660306 is a wasteful number, since it uses less digits than its factorization.
1145114660306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215330728.
The product of its (nonzero) digits is 51840, while the sum is 38.
Adding to 1145114660306 its reverse (6030664115411), we get a palindrome (7175778775717).
The spelling of 1145114660306 in words is "one trillion, one hundred forty-five billion, one hundred fourteen million, six hundred sixty thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •