Base | Representation |
---|---|
bin | 10000110011110… |
… | …10110000101010 |
3 | 100211100011010001 |
4 | 20121322300222 |
5 | 242044341020 |
6 | 21554213214 |
7 | 3331403506 |
oct | 1031726052 |
9 | 324304101 |
10 | 141012010 |
11 | 72663457 |
12 | 3b28420a |
13 | 232a2b79 |
14 | 14a29306 |
15 | c5a650a |
hex | 867ac2a |
141012010 has 8 divisors (see below), whose sum is σ = 253821636. Its totient is φ = 56404800.
The previous prime is 141011999. The next prime is 141012013. The reversal of 141012010 is 10210141.
It can be written as a sum of positive squares in 2 ways, for example, as 132503121 + 8508889 = 11511^2 + 2917^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 14101201 = 141012010 / (1 + 4 + 1 + 0 + 1 + 2 + 0 + 1 + 0).
It is not an unprimeable number, because it can be changed into a prime (141012013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7050591 + ... + 7050610.
Almost surely, 2141012010 is an apocalyptic number.
141012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141012010 is a deficient number, since it is larger than the sum of its proper divisors (112809626).
141012010 is a wasteful number, since it uses less digits than its factorization.
141012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14101208.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 141012010 is about 11874.8477884982. The cubic root of 141012010 is about 520.4975636935.
Adding to 141012010 its reverse (10210141), we get a palindrome (151222151).
The spelling of 141012010 in words is "one hundred forty-one million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •