Base | Representation |
---|---|
bin | 10011001110010000100001… |
… | …01100111000111110100111 |
3 | 12112200002201221112021020210 |
4 | 21213020100230320332213 |
5 | 21020033210133033112 |
6 | 225523104521430503 |
7 | 11622001263230640 |
oct | 1147102054707647 |
9 | 175602657467223 |
10 | 42271348330407 |
11 | 125181a6136779 |
12 | 48a857903b433 |
13 | 1a7822ba22a91 |
14 | a61d30b646c7 |
15 | 4d4894d19b3c |
hex | 267210b38fa7 |
42271348330407 has 32 divisors (see below), whose sum is σ = 64699656355840. Its totient is φ = 24047978945760.
The previous prime is 42271348330373. The next prime is 42271348330433. The reversal of 42271348330407 is 70403384317224.
42271348330407 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42271348330407 - 222 = 42271344136103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42271348330907) by changing a digit.
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, 683269 + ... + 9220062.
It is an arithmetic number, because the mean of its divisors is an integer number (2021864261120).
Almost surely, 242271348330407 is an apocalyptic number.
42271348330407 is a deficient number, since it is larger than the sum of its proper divisors (22428308025433).
42271348330407 is a wasteful number, since it uses less digits than its factorization.
42271348330407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9904243.
The product of its (nonzero) digits is 2709504, while the sum is 48.
The spelling of 42271348330407 in words is "forty-two trillion, two hundred seventy-one billion, three hundred forty-eight million, three hundred thirty thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •