Base | Representation |
---|---|
bin | 1100110000000111… |
… | …1001100110011101 |
3 | 22211120001222000212 |
4 | 3030001321212131 |
5 | 24002300101031 |
6 | 1323355502205 |
7 | 150553306010 |
oct | 31401714635 |
9 | 8746058025 |
10 | 3423050141 |
11 | 14a724a265 |
12 | 7b6457965 |
13 | 427236674 |
14 | 24688b377 |
15 | 1507ac12b |
hex | cc07999d |
3423050141 has 32 divisors (see below), whose sum is σ = 4177336320. Its totient is φ = 2741644224.
The previous prime is 3423050087. The next prime is 3423050149. The reversal of 3423050141 is 1410503243.
3423050141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3423050141 - 218 = 3422787997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3423050149) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1642286 + ... + 1644368.
It is an arithmetic number, because the mean of its divisors is an integer number (130541760).
Almost surely, 23423050141 is an apocalyptic number.
It is an amenable number.
3423050141 is a deficient number, since it is larger than the sum of its proper divisors (754286179).
3423050141 is a wasteful number, since it uses less digits than its factorization.
3423050141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2345.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 3423050141 is about 58506.8384122745. The cubic root of 3423050141 is about 1507.0850216968.
Adding to 3423050141 its reverse (1410503243), we get a palindrome (4833553384).
The spelling of 3423050141 in words is "three billion, four hundred twenty-three million, fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •