Base | Representation |
---|---|
bin | 10011001011011001100111… |
… | …01101110000100110101000 |
3 | 12112022201021102220002111120 |
4 | 21211230303231300212220 |
5 | 21011431103241404000 |
6 | 225410024531055240 |
7 | 11611624003113354 |
oct | 1145546355604650 |
9 | 175281242802446 |
10 | 42173151513000 |
11 | 1248a595639422 |
12 | 4891533141520 |
13 | 1a6bbac978bb1 |
14 | a5b2973a8464 |
15 | 4d20490666a0 |
hex | 265b33b709a8 |
42173151513000 has 128 divisors (see below), whose sum is σ = 131582452734720. Its totient is φ = 11245983993600.
The previous prime is 42173151512981. The next prime is 42173151513041. The reversal of 42173151513000 is 31515137124.
42173151513000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 348440494 + ... + 348561506.
It is an arithmetic number, because the mean of its divisors is an integer number (1027987911990).
Almost surely, 242173151513000 is an apocalyptic number.
42173151513000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42173151513000 is an abundant number, since it is smaller than the sum of its proper divisors (89409301221720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42173151513000 is a wasteful number, since it uses less digits than its factorization.
42173151513000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237204 (or 237190 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 42173151513000 in words is "forty-two trillion, one hundred seventy-three billion, one hundred fifty-one million, five hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •