Base | Representation |
---|---|
bin | 1100001101010… |
… | …10110010111010 |
3 | 21010201001002200 |
4 | 12012222302322 |
5 | 202204131300 |
6 | 14055011030 |
7 | 2352324441 |
oct | 606526272 |
9 | 233631080 |
10 | 102411450 |
11 | 52899269 |
12 | 2a369a76 |
13 | 182a92bb |
14 | d85bd58 |
15 | 8ece200 |
hex | 61aacba |
102411450 has 36 divisors (see below), whose sum is σ = 275146638. Its totient is φ = 27309600.
The previous prime is 102411431. The next prime is 102411457. The reversal of 102411450 is 54114201.
It can be written as a sum of positive squares in 3 ways, for example, as 85544001 + 16867449 = 9249^2 + 4107^2 .
It is a super-2 number, since 2×1024114502 = 20976210182205000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102411457) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 113341 + ... + 114240.
Almost surely, 2102411450 is an apocalyptic number.
102411450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102411450 is an abundant number, since it is smaller than the sum of its proper divisors (172735188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102411450 is a wasteful number, since it uses less digits than its factorization.
102411450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227599 (or 227591 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 102411450 is about 10119.8542479623. The cubic root of 102411450 is about 467.8602749658.
Adding to 102411450 its reverse (54114201), we get a palindrome (156525651).
The spelling of 102411450 in words is "one hundred two million, four hundred eleven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •