Base | Representation |
---|---|
bin | 10011001111100000001010… |
… | …00110010011111111101000 |
3 | 12112211012002121121211211211 |
4 | 21213300011012103333220 |
5 | 21021233240423403112 |
6 | 225554455234002504 |
7 | 11625043632641455 |
oct | 1147600506237750 |
9 | 175735077554754 |
10 | 42314103341032 |
11 | 12534346233aa6 |
12 | 48b490b716434 |
13 | 1a7c2837aca33 |
14 | a640291a482c |
15 | 4d5a486010a7 |
hex | 267c05193fe8 |
42314103341032 has 32 divisors (see below), whose sum is σ = 79667128156320. Its totient is φ = 21069615954240.
The previous prime is 42314103341023. The next prime is 42314103341047. The reversal of 42314103341032 is 23014330141324.
42314103341032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 42314103340985 and 42314103341003.
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 7 ways as a sum of consecutive naturals, for example, 780594 + ... + 9232417.
It is an arithmetic number, because the mean of its divisors is an integer number (2489597754885).
Almost surely, 242314103341032 is an apocalyptic number.
It is an amenable number.
42314103341032 is a deficient number, since it is larger than the sum of its proper divisors (37353024815288).
42314103341032 is a wasteful number, since it uses less digits than its factorization.
42314103341032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10015201 (or 10015197 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 42314103341032 its reverse (23014330141324), we get a palindrome (65328433482356).
The spelling of 42314103341032 in words is "forty-two trillion, three hundred fourteen billion, one hundred three million, three hundred forty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •