Base | Representation |
---|---|
bin | 11101100011001111001… |
… | …111010001011011111100 |
3 | 21012010121002001011020000 |
4 | 131203033033101123330 |
5 | 231232334032413004 |
6 | 4152520311354300 |
7 | 266466450350412 |
oct | 35431717213374 |
9 | 7163532034200 |
10 | 2030701451004 |
11 | 713241035396 |
12 | 289691982990 |
13 | 119657056125 |
14 | 7040212d2b2 |
15 | 37c534b3c39 |
hex | 1d8cf3d16fc |
2030701451004 has 120 divisors (see below), whose sum is σ = 5420429894880. Its totient is φ = 662795882496.
The previous prime is 2030701450957. The next prime is 2030701451017. The reversal of 2030701451004 is 4001541070302.
2030701451004 is a `hidden beast` number, since 203 + 0 + 7 + 0 + 1 + 451 + 0 + 0 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2628252 + ... + 3311964.
It is an arithmetic number, because the mean of its divisors is an integer number (45170249124).
Almost surely, 22030701451004 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2030701451004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2710214947440).
2030701451004 is an abundant number, since it is smaller than the sum of its proper divisors (3389728443876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2030701451004 is a wasteful number, since it uses less digits than its factorization.
2030701451004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683921 (or 683910 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The spelling of 2030701451004 in words is "two trillion, thirty billion, seven hundred one million, four hundred fifty-one thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •